MCPcopy Create free account

hub / github.com/SR-Sunny-Raj/Hacktoberfest2021-DSA / functions

Functions4,122 in github.com/SR-Sunny-Raj/Hacktoberfest2021-DSA

↓ 1 callersMethodlevelOrder
Function to return the level order traversal of a tree.
14. Tree/Level order traversal.cpp:48
↓ 1 callersMethodlevelOrder
(Node node)
14. Tree/Class6.java:96
↓ 1 callersMethodlevelOrderLinewise
(Node node)
14. Tree/Class7.java:96
↓ 1 callersMethodlevelOrderTraversal
(self, index)
14. Tree/BinaryTreePL.py:42
↓ 1 callersFunctionlevelorder
30. CPP Programs/level order traversal of binary tree.cpp:29
↓ 1 callersMethodlexoSubseqK
(int[] arr, int k)
11. Stack/Lexographically smallest subsequence of length k/lexoKsubseq.java:10
↓ 1 callersFunctionlinearSearch
05. Searching/basic_search.cpp:5
↓ 1 callersFunctionlinearsearch
(arr, x)
05. Searching/LinearSearch.py:1
↓ 1 callersFunctionlinkedlisttraversal
10. Linked List/doublyll.cpp:8
↓ 1 callersFunctionlinkedlisttraversal
10. Linked List/circular_ll.cpp:8
↓ 1 callersFunctionlis
20. Dynamic Programming/longest_increasing_subsequence.cpp:4
↓ 1 callersFunctionlis
20. Dynamic Programming/Longest_increasing_subsequence.cpp:4
↓ 1 callersMethodlistprint
(self, node)
33. Python Programs/doubly_linkedlist.py:20
↓ 1 callersFunctionlongestAlternating
04. Arrays/longest_alternating_subarray.cpp:5
↓ 1 callersFunctionlongestConsecutive
main function to find the longest consecutive numbers in an array
23. Disjoint Set/LongestConsecutiveSequence.cpp:35
↓ 1 callersFunctionlongestPalindrome
20. Dynamic Programming/longest_palindromic_substring.cpp:4
↓ 1 callersFunctionlongestPalindrome
09. String/4_Longest Palindromic Substring.cpp:37
↓ 1 callersFunctionlongestSubarray
04. Arrays/longest_subarray_of_1's_after_deletion_of_1_element.cpp:12
↓ 1 callersMethodlongestWord
21. Trie/Longest_Word_That_Can_Be_Built_One_Charcter_At_Time_From_Other_Words_In_Dictionary.cpp:48
↓ 1 callersFunctionlps
20. Dynamic Programming/longest_palindromic_subsequence.cpp:8
↓ 1 callersFunctionltrim
30. CPP Programs/Minimum Distances/min_distances.cpp:67
↓ 1 callersFunctionluas
01. Mathematics/calculate_curv.c:12
↓ 1 callersFunctionmain
06. Sorting/Bogo.cpp:30
↓ 1 callersFunctionmain
17. Graph/BFS.cpp:48
↓ 1 callersFunctionmain
12. Queue/circularqueue.cpp:54
↓ 1 callersFunctionmain
()
11. Stack/parenthesis-checker.py:28
↓ 1 callersFunctionmain
Driver code
07. Matrix/countsort.c:58
↓ 1 callersFunctionmain
()
24. Cryptography/Affine_Cipher.py:42
↓ 1 callersFunctionmain
()
24. Cryptography/Multiplicative_Cipher.py:42
↓ 1 callersFunctionmain
()
24. Cryptography/Playfair_Cipher.py:69
↓ 1 callersFunctionmain
()
33. Python Programs/tic_tac_toe.py:96
↓ 1 callersFunctionmajorityElement
04. Arrays/22_Majority Element.cpp:33
↓ 1 callersMethodmajorityWins
Function to find element with more appearances between two elements in an array.
04. Arrays/who-has-the-majority.cpp:15
↓ 1 callersFunctionmake_pa
30. CPP Programs/codechef LNGSUB solution.cpp:88
↓ 1 callersFunctionmake_part
06. Sorting/dualPivotQuickSort.cpp:21
↓ 1 callersFunctionmake_tree
17. Graph/Kruskals_Algorithm.c:70
↓ 1 callersFunctionmakesum
04. Arrays/13_Combination Sum.cpp:62
↓ 1 callersFunctionmark
28. Codechef Problems/Discount-on-crackers.cpp:8
↓ 1 callersMethodmatched
(char a, char b)
11. Stack/paranthesis-checker.java:11
↓ 1 callersFunctionmatpow
01. Mathematics/fibonacci matrix.cpp:24
↓ 1 callersFunctionmatrixChainMemoised
Function for matrix chain multiplication
30. CPP Programs/Matrix_chain_Multiplication.cpp:27
↓ 1 callersFunctionmatrix_search
27. LeetCode Problems/Search_2D_Matrix.cpp:13
↓ 1 callersFunctionmax
06. Sorting/DYNAMIC_ACTIVITY_SELECTOR.cpp:5
↓ 1 callersMethodmax
(Node node)
14. Tree/Class4.java:60
↓ 1 callersMethodmax
(Node node)
14. Tree/Class7.java:60
↓ 1 callersMethodmax
(Node node)
14. Tree/Class6.java:60
↓ 1 callersMethodmax
(Node node)
14. Tree/Class3.java:60
↓ 1 callersMethodmaxArea
30. CPP Programs/10. Container With Most Water.cpp:7
↓ 1 callersFunctionmaxDepth
Compute the "maxDepth" of a tree -- the number of nodes along the longest path from the root node down to the farthest leaf node.*/
30. CPP Programs/MaxDepth_of_binary_tree.cpp:19
↓ 1 callersMethodmaxDepth
(TreeNode<Integer> root)
14. Tree/Max_Depth_Of_N-ary_Tree.java:37
↓ 1 callersFunctionmaxEnvelopes
04. Arrays/14_Russian Doll Envelopes.cpp:44
↓ 1 callersFunctionmaxLength
09. String/Maximum_Length_with_unique_characters.cpp:54
↓ 1 callersMethodmaxNode
()
10. Linked List/java/MaxMinLinkedList.java:59
↓ 1 callersMethodmaxProfit
(int[] prices)
20. Dynamic Programming/BestTimeToBuyAndSellStockTwo.java:14
↓ 1 callersMethodmaxProfit
(int[] prices)
20. Dynamic Programming/BestTimeToBuyAndSellStockThree.java:14
↓ 1 callersMethodmaxProfit
(int[] prices)
20. Dynamic Programming/BestTimeToBuyAndSellStockOne.java:14
↓ 1 callersFunctionmaxRectangle
07. Matrix/max_rectangle.cpp:36
↓ 1 callersFunctionmaxSlidingWindow
13. Dequeue/sliding_window_maximum.cpp:36
↓ 1 callersFunctionmaxSubArraySum
04. Arrays/kadane_algorithm.cpp:6
↓ 1 callersFunctionmaxSubArraySum
Function to calculate Largest Sum Subarray
20. Dynamic Programming/LargestSumSubarray.cpp:5
↓ 1 callersMethodmaxSubArraySum
(int a[], int size)
04. Arrays/KadansAlgorithm.java:3
↓ 1 callersFunctionmaxSubarrayXOR
Returns maximum XOR value of a subarray in arr[0..n-1]
21. Trie/Maximum_Subarray_XOR.cpp:92
↓ 1 callersMethodmaxSubstring
09. String/Maximum_difference_of_zeros_and_ones_in_binary_string.cpp:21
↓ 1 callersMethodmaxSum
(TreeNode node)
14. Tree/Maximum_Path_Sum.java:36
↓ 1 callersFunctionmax_heapify
Max heapify helper for max_heap_sort
06. Sorting/heap_sort.py:18
↓ 1 callersFunctionmaximum
10. Linked List/c lang/Linked List.c:185
↓ 1 callersFunctionmaximum_profit
20. Dynamic Programming/1_Best Time To Buy And Sell Stocks.cpp:39
↓ 1 callersFunctionmaximum_subarray_sum
04. Arrays/kadanes_algorithm.cpp:4
↓ 1 callersFunctionmaxinarray
05. Searching/painterpartitionproblem.cpp:22
↓ 1 callersFunctionmerge
Function to perform union two components
01. Mathematics/Boruvka’s Algorithm.cpp:50
↓ 1 callersFunctionmerge
30. CPP Programs/Merge Sort.cpp:4
↓ 1 callersFunctionmerge
Merge function merges the sorted runs
06. Sorting/Timsort.cpp:24
↓ 1 callersFunctionmerge
06. Sorting/inversions.cpp:16
↓ 1 callersFunctionmerge
This funt merges two sorted arrays and returns inversion count in the arrays.*/
06. Sorting/CountInversions.cpp:53
↓ 1 callersFunctionmerge
Merges two subarrays of array[]. First subarray is arr[begin..mid] Second subarray is arr[mid+1..end]
06. Sorting/Merge_sort.cpp:7
↓ 1 callersFunctionmerge
10. Linked List/c lang/merge_common_LL.c:43
↓ 1 callersFunctionmerge
15. Binary Search Tree/merging-two-bst.cpp:66
↓ 1 callersMethodmerge
(self, a, b)
10. Linked List/flatenning_a_linked_list.py:42
↓ 1 callersMethodmerge
15. Binary Search Tree/Merge_Two_BST.cpp:100
↓ 1 callersFunctionmergeSort
30. CPP Programs/Merge Sort.cpp:51
↓ 1 callersFunctionmergeSort
(arr)
06. Sorting/mergeSort.py:2
↓ 1 callersFunctionmergeSort
06. Sorting/inversions.cpp:46
↓ 1 callersFunctionmergeSort
This function sorts the input array and returns the number of inversions in the array */
06. Sorting/CountInversions.cpp:21
↓ 1 callersFunctionmergeSort
(nlist,count)
06. Sorting/merge-sort-with-count-inversion.py:1
↓ 1 callersFunctionmergeSort
begin is for left index and end is right index of the sub-array of arr to be sorted */
06. Sorting/Merge_sort.cpp:57
↓ 1 callersFunctionmergeSort
10. Linked List/MergeSortLinkedList.cpp:91
↓ 1 callersMethodmergeSort
(int a[], int beg, int end)
06. Sorting/merge_sort.java:53
↓ 1 callersFunctionmergeSortedArray
(arr1, arr2)
34. Javascript/MergeSortedArray.js:4
↓ 1 callersFunctionmergeTrees
15. Binary Search Tree/merging-two-bst.cpp:27
↓ 1 callersMethodmergeTwoLists
(ListNode l1, ListNode l2)
27. LeetCode Problems/MergeKsortedList.Java:18
↓ 1 callersFunctionmerge_all
(arr, l, m, r)
33. Python Programs/merge_sort.py:3
↓ 1 callersFunctionmerge_sort
(arr, l, r)
33. Python Programs/merge_sort.py:36
↓ 1 callersMethodmerged
(LinkedList list)
10. Linked List/java/LinkedList.java:160
↓ 1 callersFunctionmergee
28. Codechef Problems/Dish-Owner.cpp:87
↓ 1 callersFunctionmerger
04. Arrays/Count_inversions.cpp:3
↓ 1 callersFunctionmergesort
Sort array `arr[low…high]` using auxiliary array `aux`
06. Sorting/Merge sort.c:37
↓ 1 callersMethodmid
()
10. Linked List/java/middle of linked list.java:217
↓ 1 callersFunctionmidPoint
10. Linked List/MergeSortLinkedList.cpp:51
↓ 1 callersFunctionmin
06. Sorting/collecting_numbers.cpp:65
↓ 1 callersMethodminCoins
20. Dynamic Programming/Numbet of coins, coin change-2 .cpp:8
← previousnext →1,401–1,500 of 4,122, ranked by callers