MCPcopy Create free account

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

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

↓ 367 callersMethodsize
(Node node)
14. Tree/Class5.java:49
↓ 261 callersFunctionprint
30. CPP Programs/insert_inBST.cpp:123
↓ 207 callersMethodadd
11. Stack/postfix_eval.cpp:69
↓ 199 callersMethodpush
11. Stack/push_pop.cpp:23
↓ 196 callersMethodend
30. CPP Programs/fortune-teller.cpp:250
↓ 183 callersMethodbegin
30. CPP Programs/fortune-teller.cpp:246
↓ 168 callersMethodpop
11. Stack/push_pop.cpp:36
↓ 157 callersMethodsize
return size of the heap
04. Arrays/max_heap.cpp:78
↓ 155 callersMethodtop
11. Stack/Stack Using Array.cpp:43
↓ 125 callersFunctioninput
Input fun: *********/
10. Linked List/cpp/AppendLastNToFirst.cpp:18
↓ 117 callersMethodprint
30. CPP Programs/insert_inBST.cpp:60
↓ 99 callersFunctionmax
20. Dynamic Programming/longest_palindromic_subsequence.cpp:6
↓ 92 callersMethodget
10. Linked List/cpp/xorlist.cpp:63
↓ 84 callersFunctionprint
20. Dynamic Programming/floyd_warshall.cpp:31
↓ 79 callersMethodappend
insertion at end
10. Linked List/LL.cpp:23
↓ 78 callersFunctionsort
06. Sorting/cyclesort.c:2
↓ 74 callersMethodfront
12. Queue/circular_queue_implementation.cpp:42
↓ 65 callersFunctionprint
10. Linked List/even_after_odd.cpp:38
↓ 64 callersMethodsize
11. Stack/ArrayImplementStack.cpp:40
↓ 59 callersFunctionmax
06. Sorting/missing_coin_sum.cpp:53
↓ 58 callersMethodempty
12. Queue/circular_queue_implementation.cpp:46
↓ 56 callersFunctionprint
04. Arrays/RadixSort.cpp:53
↓ 51 callersMethodempty
()
11. Stack/StackUsingQueue.java:44
↓ 51 callersMethodpush
17. Graph/Maximum flow - MPM algorithm.cpp:88
↓ 48 callersMethodtop
Function to return an element with the highest priority (present at the root)
04. Arrays/max_heap.cpp:124
↓ 47 callersMethodempty
Function to check if the heap is empty or not
04. Arrays/max_heap.cpp:83
↓ 47 callersFunctionprint
A utility function to print an array
06. Sorting/Radix_sort.cpp:58
↓ 43 callersFunctionmin
06. Sorting/missing_coin_sum.cpp:65
↓ 41 callersMethodfind
(int[][] grid, int i, int j)
17. Graph/NumberOfEnclaves.java:24
↓ 40 callersFunctionmin
20. Dynamic Programming/Palindrome Partitioning.cpp:7
↓ 40 callersFunctionswap
06. Sorting/heapsort.c:22
↓ 36 callersMethodclear
14. Tree/BinaryTreeDiagram.cpp:35
↓ 32 callersFunctionfree
(i,j)
19. Backtracking/nqueen.py:39
↓ 32 callersMethodpush
(self, NewVal)
33. Python Programs/doubly_linkedlist.py:12
↓ 31 callersMethodresize
17. Graph/Maximum flow - MPM algorithm.cpp:39
↓ 28 callersMethodpop
11. Stack/Stack Using Array.cpp:56
↓ 28 callersMethodprint
(TreeNode<Integer> root)
14. Tree/Max_Depth_Of_N-ary_Tree.java:27
↓ 28 callersMethodpush
insert key into the heap
04. Arrays/max_heap.cpp:88
↓ 28 callersMethodsize
()
16. Heap/medianPriorityQueue.java:49
↓ 27 callersMethodnext
return the next value
15. Binary Search Tree/kth_Smallest_BST.cpp:54
↓ 26 callersMethodmax
(Node node)
14. Tree/Class5.java:60
↓ 26 callersMethodprint
10. Linked List/cpp/linkedlist.cpp:46
↓ 24 callersMethodisEmpty
11. Stack/postfix_eval.cpp:59
↓ 22 callersFunctionsolve
29. Codeforces Problems/697D.cpp:12
↓ 22 callersFunctionvalid
()
25. Blockchain/blockchain_creation.py:122
↓ 21 callersMethodenqueue
(self, value)
12. Queue/QueueNoSize.py:15
↓ 21 callersMethodpop
Function to remove an element with the highest priority (present at the root)
04. Arrays/max_heap.cpp:99
↓ 21 callersMethodremove
08. Hashing/separatechaining.cpp:110
↓ 20 callersMethodpush
11. Stack/Stack Using Array.cpp:21
↓ 19 callersFunctionf
01. Mathematics/regula-falsi.c:4
↓ 18 callersFunctionmax
30. CPP Programs/Knapsack_using_DP.cpp:3
↓ 18 callersFunctionrep
01. Mathematics/debug array.cpp:24
↓ 17 callersMethodadd
(self,st)
27. LeetCode Problems/14-Longest_Common_Prefix.py:12
↓ 16 callersMethodadd
04. Arrays/Dynamic array/dyarrclass.cpp:18
↓ 16 callersFunctionfind
A utility function to find set of an element i (uses path compression technique)
17. Graph/kragers.c:82
↓ 16 callersMethodinsert
30. CPP Programs/insert_inBST.cpp:55
↓ 16 callersFunctionsolve
17. Graph/steppingNumbers.cpp:2
↓ 15 callersMethodinsert
Insertion
21. Trie/Trie.cpp:32
↓ 15 callersMethodinsert
08. Hashing/separatechaining.cpp:97
↓ 15 callersFunctionmin
30. CPP Programs/airline_restriction.cpp:43
↓ 15 callersMethodsize
()
10. Linked List/java/LinkedList.java:81
↓ 14 callersMethodinsert
(int value)
10. Linked List/java/LinkedList.java:28
↓ 14 callersFunctionlist
37. Projects/salaryManagement.c:110
↓ 14 callersFunctionreverse
04. Arrays/Reversing_Array._CPP.cpp:3
↓ 14 callersFunctionsort
10. Linked List/c lang/Linked List.c:219
↓ 13 callersMethodpop
12. Queue/circular_queue_implementation.cpp:32
↓ 13 callersMethodpush
(self,head_ref,data)
10. Linked List/flatenning_a_linked_list.py:17
↓ 13 callersMethodpush
12. Queue/circular_queue_implementation.cpp:20
↓ 13 callersMethodremove
()
16. Heap/medianPriorityQueue.java:26
↓ 13 callersFunctionsize
10. Linked List/cpp/BasicoperationsonDLL.cpp:52
↓ 13 callersFunctionswap
27. LeetCode Problems/Cycle_Sort(Numbers disappeared in an array).cpp:5
↓ 12 callersFunctionZigZag
30. CPP Programs/ZigZagPatter.cpp:7
↓ 12 callersMethodaddEdge
18. Greedy/graph colouring using greedy algo.cpp:22
↓ 12 callersMethodpeek
11. Stack/ArrayImplementStack.cpp:45
↓ 12 callersFunctionpop
11. Stack/stack.c:99
↓ 12 callersFunctionprint
03. Recursion/Print all Codes - String.cpp:26
↓ 12 callersMethodprint
04. Arrays/insert and delete an element of array.cpp:86
↓ 11 callersMethodget
04. Arrays/Dynamic array/dyarrclass.cpp:34
↓ 11 callersFunctioninsert
14. Tree/all_traversal_of_tree_using_recursion_and_iteration.cpp:25
↓ 11 callersFunctionlength
10. Linked List/c lang/Linked List.c:176
↓ 11 callersFunctionnewNode
Helper function that allocates a new node with the given data and NULL left and right pointers. */
14. Tree/check_binary_tree_subtree.cpp:63
↓ 11 callersFunctionswap
04. Arrays/selection_sort.cpp:4
↓ 11 callersMethodtoString
()
21. Trie/Trie.java:47
↓ 11 callersFunctionto_string
28. Codechef Problems/TRIGONALAREA.cpp:17
↓ 10 callersFunctionaddEdge
17. Graph/C/DFS.c:93
↓ 10 callersFunctionaddEdge
17. Graph/C/BFS.c:87
↓ 10 callersFunctionclick
(number)
33. Python Programs/odd-even GUI.py:14
↓ 10 callersFunctiondfs
29. Codeforces Problems/1592C.cpp:21
↓ 10 callersMethodfind
23. Disjoint Set/Satisfiability_of_Equality_Equations.cpp:64
↓ 10 callersFunctionprint
14. Tree/BinaryTree_BFS_Traversal.cpp:45
↓ 10 callersMethodprintList
()
10. Linked List/java/LinkedList.java:18
↓ 10 callersFunctionpush
10. Linked List/cpp/sort_LinkedList_of_0_1_2's.cpp:51
↓ 9 callersMethodlower
* @brief returns lower 64-bit integer part * @returns returns lower 64-bit integer part */
30. CPP Programs/uint128_t.hpp:201
↓ 9 callersFunctionnewNode
15. Binary Search Tree/merging-two-bst.cpp:43
↓ 9 callersFunctionpush
11. Stack/Infix_to_Postfix_and_Evaluation.c:37
↓ 9 callersFunctionreverse
Below is the function that reverses the given stack using insert_at_bottom()
03. Recursion/Reverseastack.cpp:48
↓ 9 callersMethodsort
06. Sorting/Quick_sort.cpp:51
↓ 9 callersFunctionsum
20. Dynamic Programming/Created painter_partition_dp.cpp:7
↓ 8 callersFunctionadd
* @brief Adding two string * @details Adds two long integer, only used for printing numbers * @param first First integer string * @param second Sec
30. CPP Programs/uint128_t.hpp:37
↓ 8 callersMethodcount
(int[] coeff, int k, int rhs)
20. Dynamic Programming/KVarLinearEqSolution.java:23
next →1–100 of 4,122, ranked by callers