MCPcopy Create free account

hub / github.com/anupam-kumar-krishnan/Competitive_Programming / functions

Functions2,161 in github.com/anupam-kumar-krishnan/Competitive_Programming

↓ 289 callersMethodsize
Coding Platforms(codechef,codeforces,etc)/Codeforces/920E.cpp:69
↓ 146 callersFunctionmax
Coding Platforms(codechef,codeforces,etc)/CodeChef/starters/MAXDIFFMIN.cpp:8
↓ 128 callersMethodsize
All Data Structures/Stack/stack_using_queues.cpp:56
↓ 127 callersMethodpush
All Data Structures/Stack/stack_using_queues.cpp:19
↓ 89 callersMethodpop
All Data Structures/Stack/stack_using_queues.cpp:39
↓ 89 callersMethodtop
All Data Structures/Stack/stack_using_queues.cpp:49
↓ 71 callersFunctionmin
Coding Platforms(codechef,codeforces,etc)/CodeChef/starters/MAXDIFFMIN.cpp:18
↓ 65 callersMethodlength
Coding Platforms(codechef,codeforces,etc)/LeetCode/Rotate List.cpp:3
↓ 55 callersMethodinsert
All Data Structures/TREE/AVL.cpp:91
↓ 45 callersMethodlength
All Data Structures/Singly_LL/main.cpp:39
↓ 38 callersFunctionswap
function to swap two elements
Basic Programming/BubbleSort.cpp:16
↓ 31 callersFunctionreverse
Below is the function that reverses the given stack using insert_at_bottom()
DSA 450/Stack/Reverse_stack_using_recursion.cpp:48
↓ 28 callersFunctionBalanceFactor
All Data Structures/TREE/AVLTREE.C:21
↓ 27 callersFunctioninitializeMatrix
All Algorithms/strassen.cpp:10
↓ 21 callersFunctiondisplay
All Data Structures/Singly_LL/menu_based_singly_linked_list.cpp:39
↓ 21 callersMethodfind
Coding Platforms(codechef,codeforces,etc)/Codeforces/1228D.cpp:99
↓ 20 callersFunctionNodeHeight
All Data Structures/TREE/AVLTREE.C:12
↓ 19 callersFunctionsolve
Coding Platforms(codechef,codeforces,etc)/Codeforces/1A.cpp:50
↓ 18 callersMethodfind
(char[][] board, int i, int j, TrieNode root, Set<String> res)
Coding Platforms(codechef,codeforces,etc)/LeetCode/word search II.java:14
↓ 17 callersFunctioninput
All Algorithms/strassen.cpp:23
↓ 16 callersFunctionadd
All Algorithms/strassen.cpp:47
↓ 15 callersFunctionaddMatrix
All Algorithms/Algebraic algorithms/strassen_matrix.c:5
↓ 15 callersMethodadd_edge
(self, u, v, w)
All Algorithms/Graph Algorithm/Kruskal Algorithm in Python.py:7
↓ 15 callersMethodappend
All Data Structures/Singly_LL/main.cpp:19
↓ 14 callersFunctionfind
* Given two force vectors, find out whether they are parallel, perpendicular or neither. Let the first vector be A = a1 i +a2 j + a3 k and the second
Coding Platforms(codechef,codeforces,etc)/GeeksforGeeks/Parallel_or_Perpendicular.cpp:22
↓ 14 callersFunctionfrn
Coding Platforms(codechef,codeforces,etc)/Codeforces/C_1703.cpp:29
↓ 13 callersMethodadd
add this type of condition-> add(a,af,b,bf) means if a is af then b must need to be bf
All Algorithms/Graph Algorithm/2 SAT.cpp:48
↓ 12 callersFunctiondfs
Coding Platforms(codechef,codeforces,etc)/Codeforces/Bakry_and_Partitioning.cpp:29
↓ 12 callersMethodgetRoot
All Data Structures/TREE/BST.cpp:21
↓ 11 callersMethodiInsert
All Data Structures/TREE/BST.cpp:34
↓ 10 callersMethodaddEdge
(int u, int v, boolean isDirected)
All Algorithms/Graph Algorithm/KahnsAlgorithmsCycleDetection.java:68
↓ 10 callersFunctionenqueue
Function to add an item to the queue. It changes rear and size
Basic Programming/queue.c:45
↓ 9 callersFunctionCreateNode
DSA 450/Binary Trees/insertion.cpp:15
↓ 9 callersFunctionDelete
All Data Structures/TREE/BST.C:110
↓ 9 callersFunctionHeight
All Data Structures/TREE/BST.C:87
↓ 9 callersFunctionInorder
All Data Structures/TREE/BST.C:43
↓ 9 callersMethodadd
(String s, int index)
Coding Platforms(codechef,codeforces,etc)/LeetCode/word search II.java:29
↓ 9 callersMethodenqueue
All Data Structures/Queues/queueUsingLinkedList.cpp:22
↓ 9 callersFunctionpush
push an item to stack
All Data Structures/Stack/Sort_stack_using_recursion.cpp:22
↓ 8 callersFunctionRInsert
All Data Structures/TREE/BST.C:70
↓ 8 callersMethodfind
(self, parent, i)
All Algorithms/Graph Algorithm/Kruskal Algorithm in Python.py:10
↓ 8 callersMethodprint
(int arr[], int n)
All Algorithms/Sorting Algorithm/radix_sort.java:64
↓ 8 callersFunctionswap
All Algorithms/Sorting Algorithm/bubble_sort.c:2
↓ 7 callersFunctionfrnj
Coding Platforms(codechef,codeforces,etc)/Codeforces/B_1647.cpp:20
↓ 7 callersMethodinsert
(int key)
All Data Structures/Binary Search Tree/BinarySearchTree.java:29
↓ 7 callersMethodinsert
All Data Structures/Binary Search Tree/CreateBinarySearchTree.cpp:15
↓ 7 callersFunctionisEmpty
All Data Structures/Queues/double-ended_queue(deque) .c:33
↓ 7 callersFunctionmerge
All Data Structures/Sorting/mergeSort.cpp:14
↓ 7 callersFunctionnewNode
Utility function to create a new tree node
All Data Structures/TREE/Reverse tree path.cpp:88
↓ 7 callersFunctionsubMatrix
All Algorithms/Algebraic algorithms/strassen_matrix.c:23
↓ 7 callersFunctionsubtract
All Algorithms/strassen.cpp:55
↓ 7 callersFunctionswap
All Data Structures/Sorting/quickSort.cpp:6
↓ 7 callersFunctionswap
All Data Structures/Arrays/3) Kth smallest Element.cpp:49
↓ 6 callersMethodaddEdge
All Data Structures/GRAPHS/BFS_Explanation_Graph.cpp:34
↓ 6 callersMethodaddEdge
All Algorithms/Graph Algorithm/topologicalSort.cpp:38
↓ 6 callersMethodenqueue
All Data Structures/Queues/ImplementCircularQueue.cpp:28
↓ 6 callersFunctionfin
Coding Platforms(codechef,codeforces,etc)/Codeforces/Cutting a graph (Codeforces Edu).cpp:23
↓ 6 callersFunctioninsert
All Data Structures/Trie/LCPtrie.cpp:33
↓ 6 callersMethodisEmpty
All Data Structures/Queues/ImplementCircularQueue.cpp:24
↓ 6 callersFunctionpush
DSA 450/Linked List/Merge Sort for Linked Lists.cpp:90
↓ 6 callersFunctionsum
Coding Platforms(codechef,codeforces,etc)/Codeforces/1228D.cpp:148
↓ 5 callersMethodInorder
All Data Structures/TREE/BST.cpp:85
↓ 5 callersMethodadd
DSA 450/Linked List/addTwoNumbersRepresentedByLinkedList.cpp:79
↓ 5 callersMethodaddEdge
All Data Structures/GRAPHS/kosaraju's_algo.cpp:62
↓ 5 callersFunctionheight
All Data Structures/TREE/Tree.c:159
↓ 5 callersFunctioninorder
inorder also sort the bst,we don't need new function.
DSA 450/Binary Search Tree/Bst-implementaion.cpp:159
↓ 5 callersFunctioninsert
Function to insert an element into the tree
All Data Structures/Queues/PriorityQueue.cpp:35
↓ 5 callersFunctionnewNode
Accolite/Binary Tree into its Mirror Tree.cpp:12
↓ 5 callersMethodrange_query
All Data Structures/Segment Tree/segment_tree.cpp:62
↓ 5 callersFunctionsetToZero
All Algorithms/strassen.cpp:17
↓ 4 callersFunctionDisplay
All Data Structures/CircularLinkedList/circular_singly_linked_list.c:30
↓ 4 callersFunctionFind
All Data Structures/GRAPHS/Kruskal'sMinSpanningTree.cpp:28
↓ 4 callersFunctionLLRotation
All Data Structures/TREE/AVLTREE.C:30
↓ 4 callersFunctionRRRotation
All Data Structures/TREE/AVLTREE.C:66
↓ 4 callersMethodaddEdge
All Data Structures/GRAPHS/Detect_Cycle_in_Directed_Graph.cpp:16
↓ 4 callersFunctioncount
All Data Structures/CircularLinkedList/circular_doubly_linked_list.c:43
↓ 4 callersMethoddequeue
All Data Structures/Queues/queueUsingLinkedList.cpp:33
↓ 4 callersFunctioninsertAtTail
All Data Structures/Singly_LL/linkedlist.cpp:18
↓ 4 callersFunctionkthSmallest
All Data Structures/Arrays/3) Kth smallest Element.cpp:28
↓ 4 callersFunctionpop
remove an item from stack
All Data Structures/Stack/Sort_stack_using_recursion.cpp:37
↓ 4 callersFunctionprimeNum
Basic Programming/pattern.c:3
↓ 4 callersFunctionprimeNumReverse
Basic Programming/pattern.c:10
↓ 4 callersFunctionpush
Coding Platforms(codechef,codeforces,etc)/LeetCode/Detect loop in linked list_ayush91985.cpp:11
↓ 4 callersFunctionsearch
prints all occurrences of pattern in text using Z algo
All Algorithms/String algorithms/Z-algorithm.cpp:9
↓ 4 callersFunctionspaces
Basic Programming/pattern.c:17
↓ 3 callersFunctionDFS
Based on Lecture
All Data Structures/GRAPHS/DepthFirstSearchUsingSTL.cpp:7
↓ 3 callersFunctionDisplay
All Data Structures/CircularLinkedList/circular_doubly_linked_list.c:33
↓ 3 callersFunctionEnqueue
implement enqueue method by using only stacks and the push and pop functions
Accolite/Implement a queue using two stacks.cpp:6
↓ 3 callersFunctionInPre
All Data Structures/TREE/BST.C:96
↓ 3 callersFunctionInSucc
All Data Structures/TREE/BST.C:103
↓ 3 callersFunctionLRRotation
All Data Structures/TREE/AVLTREE.C:46
↓ 3 callersFunctionPostorder
All Data Structures/TREE/Tree.c:71
↓ 3 callersFunctionPreorder
All Data Structures/TREE/Tree.c:51
↓ 3 callersFunctionRInsert
All Data Structures/TREE/AVLTREE.C:75
↓ 3 callersFunctionRLRotation
All Data Structures/TREE/AVLTREE.C:70
↓ 3 callersFunctionbinary_search
(arr, low, high, x)
All Algorithms/Searching Algorithm/binary.py:7
↓ 3 callersFunctioncheck
Coding Platforms(codechef,codeforces,etc)/Codeforces/1228D.cpp:271
↓ 3 callersFunctioncreate
All Data Structures/CircularLinkedList/circular_doubly_linked_list.c:11
↓ 3 callersFunctioncreateNode
create Node
DSA 450/Binary Trees/print_all_left_child_elements.cpp:15
↓ 3 callersFunctiondequeue
Function to remove an item from queue. It changes front and size
Basic Programming/queue.c:58
next →1–100 of 2,161, ranked by callers