MCPcopy Create free account

hub / github.com/Ayush7614/Daily-Coding-DS-ALGO-Practice / functions

Functions2,762 in github.com/Ayush7614/Daily-Coding-DS-ALGO-Practice

↓ 1 callersFunctionSmallestPermutation
(a,b)
Algorithms/Dynamic Problems/Python/LexicographicallySmallestPermutation.py:6
↓ 1 callersFunctionSolution
(arr)
Leetcode/Python/median_of_2_sorted_arrays.py:2
↓ 1 callersFunctionSolve
Algorithms/MCM_Memoisation.cpp:8
↓ 1 callersFunctionSort
Data Structures/LinkedList/C/Operations_on_linkedlist.c:320
↓ 1 callersFunctionSort_zero_one_two
Linear time partition function to sort an array containing 0, 1, and 2
Gfg/C/Sort_in_linear_time.c:12
↓ 1 callersFunctionSparse_search
Algorithms/Searching and Sorting/C++/Sparse_search.cpp:8
↓ 1 callersFunctionSubArray
SubArray Fucntion
Data Structures/Array/C++/SubArrayWithSum.cpp:19
↓ 1 callersFunctionTargetSum
Leetcode/C++/Target_Sum.cpp:32
↓ 1 callersFunctionTernary_search
Function to search data in a given array
Algorithms/Searching and Sorting/C++/Ternary_search.cpp:7
↓ 1 callersFunctionTribonacci_Number
(n)
Algorithms/Miscellaneous/Python/N-th Tribonacci Number.py:1
↓ 1 callersFunctionTriplets
Gfg/C++/TripletswithZeroSum.cpp:15
↓ 1 callersMethodUnion
(subset subsets[], int x, int y)
Algorithms/Greedy Algorithms/Java/Kruskal’s Minimum Spanning Tree Algorithm.java:57
↓ 1 callersFunctionValid_Mount
(arr:list[int])
Leetcode/Python/Valid_Mountain_Problem.py:1
↓ 1 callersFunction_printParenthesis
(str, pos, n, open, close)
Gfg/Python/Generate_Balanced_parenthesis.py:36
↓ 1 callersFunctionaVeryBigSum
Hackerank/C++/A Very Big Sum.cpp:38
↓ 1 callersMethodadd1
(Node head)
Gfg/Java/Add-1-to-a-number-represented-as-linked-list.java:73
↓ 1 callersMethodaddBinary
Leetcode/C++/AddBinary.cpp:31
↓ 1 callersMethodaddEdge
Algorithms/Graph/C++/DFSGraphValidation.cpp:38
↓ 1 callersFunctionaddFraction
Adding two fractions
Gfg/C++/Add two fractions.cpp:40
↓ 1 callersMethodaddOne
(Node head)
Gfg/Java/Add-1-to-a-number-represented-as-linked-list.java:64
↓ 1 callersMethodaddTwoLists
(Node first, Node second)
Gfg/add two number by linked list.java:21
↓ 1 callersMethodaddTwoLists
function to add two numbers represented by Linked Lists
Gfg/C++/Add two numbers represented by linked lists.cpp:78
↓ 1 callersFunctionadd_edge
Data Structures/Graph/C++/cycle_in_undirectedgraph_using_dfs.cpp:46
↓ 1 callersFunctionadd_edge
Data Structures/Graph/C++/Bipartite_using_DFS.cpp:44
↓ 1 callersMethodaddedge
Gfg/Minimum spanning tree.cpp:61
↓ 1 callersFunctionalive
Algorithms/Dynamic Problems/C++/Alive.cpp:12
↓ 1 callersFunctionallIndexes
(input, x, start)
Gfg/All_indices.py:1
↓ 1 callersFunctionallIndices
(input, x)
Gfg/All_indices.py:26
↓ 1 callersFunctionallPalPartUtil
(allPart: list, currPart: list, start: int, n: int, string: str)
Algorithms/Miscellaneous/Python/Palindromic_Partition.py:20
↓ 1 callersFunctionallPalPartUtil
Recursive function to find all palindromic partitions of str[start..n-1] allPart --> A vector of vector of strings. Every vector inside it stores a pa
Algorithms/Miscellaneous/C++/Palindromic_Partitions.cpp:22
↓ 1 callersFunctionallPalPartitions
(string: str)
Algorithms/Miscellaneous/Python/Palindromic_Partition.py:55
↓ 1 callersFunctionallPalPartitions
Function to print all possible palindromic partitions of str. It mainly creates vectors and calls allPalPartUtil()
Algorithms/Miscellaneous/C++/Palindromic_Partitions.cpp:53
↓ 1 callersFunctionallocate_minimum_number_of_pages
Gfg/C++/Allocate_minimum_number_of_pages.cpp:32
↓ 1 callersFunctionalternatingCharacters
(s)
Hackerank/Python/Alternating Characters.py:9
↓ 1 callersFunctionalternatingCharacters
Hackerank/C++/Alternating Characters.cpp:45
↓ 1 callersFunctionanagram
Complete the anagram function below.
Hackerank/C/Anagram.c:14
↓ 1 callersFunctionanagram
(str1,str2)
Gfg/Python/anagram.py:3
↓ 1 callersFunctionangryProfessor
Hackerank/C++/Angry Professor.cpp:46
↓ 1 callersFunctionappend
Data Structures/LinkedList/C++/reverse_LL.cpp:16
↓ 1 callersMethodareIsomorphic
Function to check if two strings are isomorphic.
Gfg/C++/isomorphic_strings.cpp:20
↓ 1 callersFunctionarea
function to find maximum area and return it to main function
Data Structures/Stack/C/histogram.c:81
↓ 1 callersFunctionarr_display
Data Structures/Stack/C++/Stack_operation.cpp:57
↓ 1 callersFunctionarr_implementation
Data Structures/Stack/C++/Stack_operation.cpp:74
↓ 1 callersFunctionarr_pop
Data Structures/Stack/C++/Stack_operation.cpp:38
↓ 1 callersFunctionarr_push
Data Structures/Stack/C++/Stack_operation.cpp:21
↓ 1 callersFunctionarr_top_element
Data Structures/Stack/C++/Stack_operation.cpp:52
↓ 1 callersFunctionarrange
Gfg/C++/Sort 0s 1s 2s.cpp:6
↓ 1 callersFunctionarrayManipulation
Hackerank/C++/Array-Manipulation.cpp:37
↓ 1 callersFunctionarrayManipulation
Complete the arrayManipulation function below.
Data Structures/Array/C++/Array Manipulation.cpp:5
↓ 1 callersFunctionarraySort
Algorithms/Searching and Sorting/C++/Insertion Sort using Call By Reference method.cpp:5
↓ 1 callersFunctionarraySort
Algorithms/Searching and Sorting/C/Insertion Sort using Call By Reference method.c:3
↓ 1 callersMethodarrayStringsAreEqual
(String[] word1, String[] word2)
Leetcode/Check If Two String Arrays are Equivalent.java:6
↓ 1 callersFunctionavg
Algorithms/Searching and Sorting/C++/BinarySearch_Comparisons_Count.cpp:26
↓ 1 callersMethodbalancefactor
(Node node)
Data Structures/Tree/Java/AVL_Tree.java:103
↓ 1 callersFunctionbeadSort
Algorithms/Searching and Sorting/C++/Bead_Sort.cpp:13
↓ 1 callersMethodbeautifulArray
(int n)
Leetcode/Java/BeautifulArray.java:21
↓ 1 callersFunctionbeautifulDays
Hackerank/C++/Beautiful Days at the Movies.cpp:54
↓ 1 callersFunctionbellman_ford
Bellman ford function to check negative cycle * v = no. of verties * e = no. of edges * edges = vector of {x, {y, w}} such that x->y is an edge
Algorithms/JohnsonAlgorithm.cpp:37
↓ 1 callersFunctionbfs
Algorithms/Graphs/Prisoners_escape.cpp:57
↓ 1 callersFunctionbinarySearch
A binary search based function to find the position where item should be inserted in a[low..high]
Algorithms/Searching and Sorting/C++/Binary Insertion Sort.cpp:9
↓ 1 callersFunctionbinarySearch
A recursive binary search function. It returns location of x in given array arr[l..r] is present, otherwise -1
Algorithms/Searching and Sorting/C++/binary_recursive_search.cpp:8
↓ 1 callersFunctionbinarySearch
searching element in array a by binary search algoritm
Algorithms/Searching and Sorting/C++/Binary_Insertion_Sort.cpp:12
↓ 1 callersFunctionbinarySearch
(a,n)
Gfg/Python/Find_n_in_array.py:14
↓ 1 callersFunctionbinarySearch
Gfg/C++/Find_n_in_array.cpp:5
↓ 1 callersFunctionbinary_search
Function to search data using binary search
Algorithms/Searching and Sorting/C/Binary_search.c:13
↓ 1 callersMethodbinomialCoeff
(int n, int k)
Gfg/Java/PascalsTriangle.java:6
↓ 1 callersFunctionbirthdayCakeCandles
(candles)
Hackerank/Python/Birthday Cake Candles.py:13
↓ 1 callersFunctionbirthdayCakeCandles
Hackerank/C++/Birthday Cake Candles.cpp:19
↓ 1 callersFunctionbirthdayCakeCandles
Hackerank/C++/hackerrank_birthdaycake.cpp:16
↓ 1 callersMethodbits
(int n)
Leetcode/Java/Number of 1 Bits.java:7
↓ 1 callersFunctionbonAppetit
(bill, k, b)
Hackerank/Python/Bill Division.py:18
↓ 1 callersFunctionbonAppetit
Hackerank/C++/Bill Division.cpp:43
↓ 1 callersFunctionbottomView
Function to print the bottom view of the Tree
Gfg/C++/Bottom_view_of_a_Tree.cpp:17
↓ 1 callersMethodbracketMatch
(char ch, char top)
Gfg/Java/Parenthesis_Checker.java:76
↓ 1 callersFunctionbreakingRecords
(scores)
Hackerank/Python/Breaking the records.py:16
↓ 1 callersFunctionbreakingRecords
Hackerank/C++/Breaking The Records.cpp:50
↓ 1 callersFunctionbruteForce
A Brute Force method to return the smallest distance between two points in P[] of size n
Algorithms/Divide and Conquer/C++/Closest Pair of Points using Divide and Conquer algorithm.cpp:45
↓ 1 callersFunctionbst
Algorithms/Searching and Sorting/searching_bst.cpp:29
↓ 1 callersFunctionbubbleSort
(arr)
Algorithms/Searching and Sorting/Python/Bubble Sort in Python.py:4
↓ 1 callersFunctionbubbleSort
Algorithms/Searching and Sorting/C++/BubbleSort_Comparisons_Count.cpp:11
↓ 1 callersFunctionbubbleSort
Algorithms/Searching and Sorting/C/Bubble Sort.c:3
↓ 1 callersFunctionbucketSort
(x)
Algorithms/Searching and Sorting/Python/Bucket_Sort.py:12
↓ 1 callersMethodbucket_sort
(float[] array, int n)
Algorithms/Bucket_Sort_JAVA.java:19
↓ 1 callersFunctionbuildBalancedTree
Gfg/C++/normal_BST_to_Balanced_BST.cpp:62
↓ 1 callersFunctionbuildHeap
Function to build a heap of arr[0..n-1] and alue of k.
Algorithms/Dynamic Problems/k_arrayheap.cpp:78
↓ 1 callersFunctionbuildTree
Function to Build Tree
Leetcode/C++/Path Sum III.cpp:60
↓ 1 callersFunctionbuildTree
Build Tree function implementation - Recursively builds tree (preorder build)
Data Structures/Tree/C++/Binary Tree.cpp:31
↓ 1 callersFunctionbuildTree
Function to Build Tree
Gfg/C++/top_View_of_Binary_Tree.cpp:81
↓ 1 callersFunctionbuildTree
{ Driver Code Starts
Gfg/C++/Duplicate subtree in Binary Tree.cpp:67
↓ 1 callersFunctionbuildTree
Gfg/C++/normal_BST_to_Balanced_BST.cpp:107
↓ 1 callersFunctionbuildTree
{ Driver Code Starts Function to Build Tree
Gfg/C++/largest_BST.cpp:71
↓ 1 callersFunctionbuildTree
{ Driver Code Starts. Function to Build Tree
Gfg/C++/k-th_smallest_element_in_BST.cpp:60
↓ 1 callersFunctionbuildTree
Function to Build Tree
Gfg/C++/Diagonal Traversal of Binary Tree.cpp:69
↓ 1 callersFunctionbuildTree
Gfg/C++/Sum_of_nodes_on_the_longest_path_from_root_to_leaf.cpp:73
↓ 1 callersMethodbuildTree
(int[] preorder, int[] inorder)
Leetcode/Java/BinaryTreeFromPreorderAndInorder.java:34
↓ 1 callersMethodbuildTree
(String str)
Gfg/Java/Diameter of Binary Tree.java:21
↓ 1 callersFunctioncaesarCipher
(s, k)
Hackerank/Python/Caesar Cipher.py:9
↓ 1 callersMethodcalKeyMatrix
(String key, int len)
Gfg/Main.java:74
↓ 1 callersFunctioncalcWater
Leetcode/C++/Rainwater_trapping.cpp:26
↓ 1 callersMethodcalculate
Operating System/CPU Scheduler/Round Robin.cpp:146
← previousnext →401–500 of 2,762, ranked by callers