MCPcopy Create free account

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

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

↓ 8 callersMethodedgeLength
(int[] pointA, int[] pointB, boolean wantSquare)
27. LeetCode Problems/ValidSquare.java:43
↓ 8 callersMethodenqueue
12. Queue/QueuesusingLinkedList.cpp:25
↓ 8 callersFunctiongotoxy
30. CPP Programs/PACMAN.cpp:38
↓ 8 callersFunctiongotoxy
37. Projects/Mini Project/PACMAN.cpp:38
↓ 8 callersMethodisEmpty
(self)
12. Queue/QueueNoSize.py:9
↓ 8 callersMethodisEmpty
11. Stack/Stack Using Array.cpp:10
↓ 8 callersMethodmin
(int a, int y)
05. Searching/FibonacciSearch.java:6
↓ 8 callersFunctionpush
11. Stack/StackusingLinkedList.cpp:12
↓ 8 callersFunctionshift_solution
01. Mathematics/20_Linear_Diophantine_with_two_variables.cpp:47
↓ 8 callersMethodupper
* @brief returns upper 128-bit integer part * @returns returns upper 128-bit integer part */
30. CPP Programs/uint256_t.hpp:175
↓ 7 callersMethodQueue
12. Queue/QueuesusingLinkedList.cpp:19
↓ 7 callersFunctionadd_edge
17. Graph/adjacency_matrix.cpp.c:38
↓ 7 callersMethodcopy
()
10. Linked List/java/LinkedList.java:116
↓ 7 callersFunctioncount
10. Linked List/c lang/all_func.c:165
↓ 7 callersFunctiondeletion
10. Linked List/SinglyLL.cpp:56
↓ 7 callersFunctiondisplay
10. Linked List/cpp/BasicoperationsonDLL.cpp:62
↓ 7 callersFunctiondisplay_list
10. Linked List/cpp/LinkedListOperations.cpp:14
↓ 7 callersFunctiongetMaxST
22. Segment Tree/max_segtree_lazy.cpp:33
↓ 7 callersFunctioninsert
10. Linked List/find_pairs_with_given_sum_in_doubly_linked_list.cpp:16
↓ 7 callersFunctioninsert
10. Linked List/cpp/DLL Pair Sum.cpp:35
↓ 7 callersMethodinsert
* @brief Utility function that adds a new element at the end of the list * @param new_elem element be added at the end of the list */
10. Linked List/Reverse_Linked_List.cpp:73
↓ 7 callersMethodinsert
15. Binary Search Tree/insert_inBST.cpp:55
↓ 7 callersFunctionnewNode
15. Binary Search Tree/distance_between_2nodes.cpp:10
↓ 7 callersFunctionnewNode
15. Binary Search Tree/find_lowest_common_ancestor_bst.cpp:29
↓ 7 callersFunctionpop
11. Stack/Infix_to_Postfix_and_Evaluation.c:47
↓ 7 callersMethodpop
Function to remove an element with the lowest priority (present at the root)
04. Arrays/Min Heap.cpp:99
↓ 7 callersMethodprint
(int arr[], int n)
06. Sorting/Radix_sort.java:62
↓ 7 callersFunctionpush
11. Stack/stack.c:89
↓ 7 callersMethodtop
Function to return an element with the lowest priority (present at the root)
04. Arrays/Min Heap.cpp:124
↓ 6 callersMethodaddChild
(self, TreeNode)
14. Tree/CreateTree.py:12
↓ 6 callersFunctionaddEdge
06. Sorting/TopologicalSort.cpp:5
↓ 6 callersFunctionaddEdge
17. Graph/cycledetectionDGdfs.cpp:7
↓ 6 callersFunctionaddEdge
17. Graph/topologicalsortdfs.cpp:10
↓ 6 callersMethodaddEdge
(int v, int w)
17. Graph/dfs_recursive.java:19
↓ 6 callersMethodaddEdge
17. Graph/Graph_Adjacency_List_WIth_Node_Class.cpp:25
↓ 6 callersMethodaddEdge
17. Graph/bfs traversal.cpp:34
↓ 6 callersFunctionaddLast
10. Linked List/revlinkedListusingrec.c:13
↓ 6 callersMethodaddLast
(int val)
10. Linked List/java/middle of linked list.java:15
↓ 6 callersMethodcontains
08. Hashing/separatechaining.cpp:83
↓ 6 callersMethoddequeue
(self)
12. Queue/QueueNoSize.py:19
↓ 6 callersFunctiondfs
BFS algorithm
17. Graph/C/DFS.c:43
↓ 6 callersFunctiondisplayList
To display the list
10. Linked List/LinkedListBasic-Operations.cpp:112
↓ 6 callersMethodenqueue
12. Queue/circularqueue.cpp:22
↓ 6 callersFunctionfind
05. Searching/3_First and last occurrences of x.cpp:84
↓ 6 callersFunctionfind_idx
* @brief Utility function for finding index * @details Utility function for finding the position of a character in array * `chars` * @param c chara
30. CPP Programs/base64_encoding.cpp:90
↓ 6 callersFunctiongotoxy
User defined function*/
36. C Programs/calendar.c:7
↓ 6 callersFunctioninsertAtTailCll
10. Linked List/cpp/Linked List Complete.cpp:361
↓ 6 callersFunctioninsertBST
14. Tree/Connect nodes at same level.cpp:16
↓ 6 callersFunctioninsertBST
15. Binary Search Tree/simple_BST.cpp:16
↓ 6 callersMethodinsertSLL
(self, value, location)
10. Linked List/SinglyLinkedList.py:19
↓ 6 callersFunctionnumber
01. Mathematics/21. Return 100 and 101 without using conditionals.cpp:9
↓ 6 callersFunctionpartition
(arr, low, high)
06. Sorting/quicksort.py:1
↓ 6 callersMethodpush
insert key into the heap
04. Arrays/Min Heap.cpp:88
↓ 6 callersMethodremoveFirst
()
10. Linked List/java/middle of linked list.java:41
↓ 6 callersFunctionreverse
10. Linked List/c lang/Linked List.c:238
↓ 6 callersFunctionroot
Function to find root of a certain component for union find algorithm
01. Mathematics/Boruvka’s Algorithm.cpp:41
↓ 6 callersFunctionswap
06. Sorting/dualPivotQuickSort.cpp:15
↓ 6 callersFunctionswap
(a, b, arr)
33. Python Programs/quick_sort.py:2
↓ 6 callersMethodupper
* @brief returns upper 64-bit integer part * @returns returns upper 64-bit integer part */
30. CPP Programs/uint128_t.hpp:207
↓ 6 callersFunctionwordBreak
21. Trie/Word_break.cpp:54
↓ 5 callersFunctionaddEdge
17. Graph/topologicalsortbfs.cpp:8
↓ 5 callersMethodaddEdge
17. Graph/Graph_Adjacency_List.cpp:14
↓ 5 callersFunctioncheck
(string, sub_str)
33. Python Programs/SearchSubString.py:2
↓ 5 callersFunctioncheckInput
check if input is valid if not update with valid number
30. CPP Programs/fortune-teller.cpp:8
↓ 5 callersFunctioncount
20. Dynamic Programming/coin_change.cpp:5
↓ 5 callersFunctioncreateNode
14. Tree/check_BST.c:10
↓ 5 callersFunctionfind
30. CPP Programs/codechef LNGSUB solution.cpp:79
↓ 5 callersFunctionfindd
28. Codechef Problems/Dish-Owner.cpp:86
↓ 5 callersFunctiongetNode
10. Linked List/cpp/INSERTION AT PARTICULAR POSITION.cpp:13
↓ 5 callersFunctionheight
14. Tree/height_of_a_binary_tree.cpp:34
↓ 5 callersFunctioninorder
14. Tree/Inorder_BinaryTree.cpp:17
↓ 5 callersFunctioninsert
21. Trie/Word_break.cpp:24
↓ 5 callersMethodinsert
(Student std)
10. Linked List/java/LinkedListTask2.java:40
↓ 5 callersMethodinsert
(Node p1,int x)
10. Linked List/java/Node.java:39
↓ 5 callersMethodinsertNode
(self, value)
14. Tree/BinaryTreePL.py:8
↓ 5 callersFunctioninsert_r
10. Linked List/c lang/merge_common_LL.c:25
↓ 5 callersFunctioninsertathead
10. Linked List/DoublyLinkedList/Deletion_inbetween_DoublyLinkedList.cpp:10
↓ 5 callersFunctionisEmpty
11. Stack/stack.c:81
↓ 5 callersFunctionknapsack
18. Greedy/knapsack.cpp:18
↓ 5 callersFunctionnewNode
Helper function that allocates a new node with the given data and NULL left and right pointers. */
30. CPP Programs/MaxDepth_of_binary_tree.cpp:38
↓ 5 callersFunctionnewNode
14. Tree/maxdepth.cpp:17
↓ 5 callersFunctionnewNode
14. Tree/find_diameter_binary_trees.cpp:31
↓ 5 callersFunctionnewNode
14. Tree/mindepth.cpp:17
↓ 5 callersFunctionnewNode
Helper function that allocates a new node with the given data and NULL left and right pointers. */
14. Tree/convert_binary_tree_to_mirror.cpp:18
↓ 5 callersFunctionnewNode
10. Linked List/CycleDetection.cpp:10
↓ 5 callersFunctionnewNode
15. Binary Search Tree/find_diameter_binary_trees.cpp:31
↓ 5 callersFunctionpower
01. Mathematics/modular exponent loop.cpp:3
↓ 5 callersFunctionprint
print function
10. Linked List/c lang/SinglyLinkedList/Reverse a Linked List.c:66
↓ 5 callersFunctionpush
10. Linked List/cpp/DetectLoop.cpp:14
↓ 5 callersMethodpush
(self, data)
11. Stack/stack-using-linked-list.py:17
↓ 5 callersMethodpush
push element and increase count
11. Stack/Stack implementation by priority queue ( most frequently ask ).cpp:22
↓ 5 callersMethodreverse
(int[] a, int left, int right)
04. Arrays/rotateArrayKTimes.java:33
↓ 5 callersMethodswap
(int arr[], int f, int s)
06. Sorting/HeapSort.java:72
↓ 5 callersMethodtraverse
* @brief Utility function to find the i th element of the list * @returns the i th element of the list */
10. Linked List/Reverse_Linked_List.cpp:144
↓ 4 callersFunctionAddArray
30. CPP Programs/PACMAN.cpp:95
↓ 4 callersFunctionAddArray
37. Projects/Mini Project/PACMAN.cpp:95
↓ 4 callersMethodCreate_node
Create node
16. Heap/FibonacciHeap.cpp:57
↓ 4 callersFunctionInsert
Function to Insert a node */
10. Linked List/revlinkedListusingiter.c:33
↓ 4 callersFunctionInsert
15. Binary Search Tree/Binary-Search-Tree-implementation (2).cpp:10
↓ 4 callersFunctionInsert
15. Binary Search Tree/Binary-Search-Tree-implementation (1).cpp:9
← previousnext →101–200 of 4,122, ranked by callers