MCPcopy Create free account

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

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

↓ 3 callersFunctiondfs2
Coding Platforms(codechef,codeforces,etc)/Codeforces/Bakry_and_Partitioning.cpp:40
↓ 3 callersFunctionfactorial
Basic Programming/All_Patterns.c:54
↓ 3 callersFunctionfo
Coding Platforms(codechef,codeforces,etc)/Codeforces/978C.cpp:27
↓ 3 callersFunctiongcd
Coding Platforms(codechef,codeforces,etc)/CodeChef/July Long Challenge/Optimal Denomination.cpp:4
↓ 3 callersMethodhelper
(int num, String a, String b, String c)
Coding Platforms(codechef,codeforces,etc)/LeetCode/integer_to_roman.java:13
↓ 3 callersFunctioninorder
INORDER
All Data Structures/TREE/Reverse tree path.cpp:78
↓ 3 callersFunctioninsertion_sort
Basic Programming/Insertion_Sort.cpp:18
↓ 3 callersFunctionisEmpty
Queue is empty when size is 0
Basic Programming/queue.c:38
↓ 3 callersFunctionisFull
All Data Structures/Queues/double-ended_queue(deque) .c:37
↓ 3 callersFunctionnewNode
Utility function to create a new Tree Node
All Data Structures/TREE/Left_view_Of_Binary_Tree.cpp:16
↓ 3 callersFunctionnewNode
Utility function to create a new Tree Node
All Data Structures/TREE/Top_View_Of_BT.cpp:16
↓ 3 callersFunctionnewNode
Utility function to create a new Tree Node
All Data Structures/TREE/Level_Order_Traversal_in_Spiral_Form.cpp:13
↓ 3 callersFunctionnewNode
Utility function to create a new Tree Node
DSA 450/Binary Trees/level_order_traversal.cpp:13
↓ 3 callersFunctionnewNode
Utility function to create a new Tree Node
DSA 450/Binary Trees/Leftviewoftree.cpp:15
↓ 3 callersFunctionpostorder
DSA 450/Binary Search Tree/Bst-implementaion.cpp:179
↓ 3 callersFunctionpowll
Coding Platforms(codechef,codeforces,etc)/Codeforces/C_Sum_of_Cubes.cpp:4
↓ 3 callersFunctionpreorder
DSA 450/Binary Search Tree/Bst-implementaion.cpp:169
↓ 3 callersMethodrInsert
All Data Structures/TREE/BST.cpp:116
↓ 3 callersFunctionrtrim
Coding Platforms(codechef,codeforces,etc)/HackerRank/SubArrayDiv.Cpp:71
↓ 3 callersFunctionrtrim
Coding Platforms(codechef,codeforces,etc)/HackerRank/Grid_Search/c++/solution.cpp:118
↓ 3 callersFunctionswap
All Algorithms/Sorting Algorithm/Randomized_Quicksort.c:3
↓ 3 callersFunctionunin
Coding Platforms(codechef,codeforces,etc)/Codeforces/Cutting a graph (Codeforces Edu).cpp:30
↓ 2 callersFunctionBFS
All Data Structures/GRAPHS/BreadthFirstSearch.cpp:6
↓ 2 callersMethodInorder
All Data Structures/TREE/DeletionAVL.cpp:189
↓ 2 callersFunctionLCS_Pr
Top down appraoch
All Algorithms/Dynamic Programming/LIS/LongestCommonSubSeq.cpp:8
↓ 2 callersFunctionLIS
Coding Platforms(codechef,codeforces,etc)/Codeforces/C_1682.cpp:10
↓ 2 callersFunctionMerge
All Algorithms/Sorting Algorithm/IterativeMergeSort.cpp:17
↓ 2 callersFunctionPrint
All Algorithms/Sorting Algorithm/BubbleSort.cpp:6
↓ 2 callersFunctionPrint
All Algorithms/Sorting Algorithm/RecursiveMergeSort.cpp:6
↓ 2 callersFunctionPrint
All Algorithms/Sorting Algorithm/ShellSort.cpp:9
↓ 2 callersFunctionPrint
All Algorithms/Sorting Algorithm/Bucket-BinSort.cpp:6
↓ 2 callersFunctionPrint
All Algorithms/Sorting Algorithm/IterativeMergeSort.cpp:6
↓ 2 callersFunctionPrint
All Algorithms/Sorting Algorithm/InsertionSort.cpp:6
↓ 2 callersMethodPush
All Data Structures/Stack/Checkpalindrome.cpp:17
↓ 2 callersFunctionbadCharHeuristic
All Algorithms/String algorithms/Boyer Moore Algorithm.cpp:9
↓ 2 callersFunctionbuildList
DSA 450/Linked List/addTwoNumbersRepresentedByLinkedList.cpp:16
↓ 2 callersFunctioncal
All Data Structures/TREE/fenwickTree_countInversion.cpp:12
↓ 2 callersFunctioncheck
Coding Platforms(codechef,codeforces,etc)/LeetCode/sudoku.cpp:1
↓ 2 callersFunctioncheck
Coding Platforms(codechef,codeforces,etc)/spoj/Finding the Kth Prime.cpp:9
↓ 2 callersFunctioncount
All Data Structures/TREE/Tree.c:152
↓ 2 callersFunctioncreateHashValue
All Algorithms/String algorithms/rabinKarpAlgorithm.cpp:11
↓ 2 callersFunctiondfs
All Data Structures/TREE/Longest_path_in_tree.cpp:10
↓ 2 callersFunctiondisplay
All Data Structures/Sorting/selectionsort.cpp:9
↓ 2 callersFunctiondisplay
All Data Structures/Sorting/mergeSort.cpp:9
↓ 2 callersFunctiondisplay
All Algorithms/Algebraic algorithms/strassen_matrix.c:60
↓ 2 callersFunctionfrn
Coding Platforms(codechef,codeforces,etc)/Codeforces/B_1546.cpp:26
↓ 2 callersFunctiong
Coding Platforms(codechef,codeforces,etc)/CodeChef/Practice/Farmer And His Plot.cpp:4
↓ 2 callersFunctiongcd
Coding Platforms(codechef,codeforces,etc)/Codeforces/playingwithgcd.cpp:6
↓ 2 callersFunctiongetNode
All Data Structures/Trie/LCPtrie.cpp:16
↓ 2 callersMethodgetSize
All Data Structures/Queues/ImplementCircularQueue.cpp:59
↓ 2 callersFunctiongetSum
Return sum of elements in range from index qs (query start) to qe (query end). It mainly uses getSumUtil()
All Data Structures/Segment Tree/Lazy_Propagation.cpp:154
↓ 2 callersFunctionheapify
All Data Structures/Sorting/Heap_Sort.cpp:6
↓ 2 callersFunctionheapify
Function to heapify the tree
All Data Structures/Queues/PriorityQueue.cpp:15
↓ 2 callersFunctionheapify
Heapify Function
All Algorithms/Sorting Algorithm/heap_sort.cpp:7
↓ 2 callersFunctionheapify
(arr, n, i)
All Algorithms/Sorting Algorithm in Python/heap_Sort.py:5
↓ 2 callersMethodheight
(TreeNode node)
DSA 450/Binary Search Tree/Balanced_BinaryTree.java:39
↓ 2 callersFunctioninOrder
Accolite/Binary Tree into its Mirror Tree.cpp:42
↓ 2 callersFunctioninit
Coding Platforms(codechef,codeforces,etc)/spoj/Finding the Kth Prime.cpp:42
↓ 2 callersFunctioninorder
DSA 450/Binary Trees/insertion.cpp:63
↓ 2 callersFunctioninputmatrix
All Algorithms/Algebraic algorithms/strassen_matrix.c:41
↓ 2 callersFunctioninsert_start
All Data Structures/Singly_LL/menu_based_singly_linked_list.cpp:149
↓ 2 callersFunctionisEmpty
check if stack is empty
All Data Structures/Stack/Sort_stack_using_recursion.cpp:14
↓ 2 callersFunctionisVowel
* Given a string consisting of lowercase english alphabets, reverse only the vowels present in it and print the resulting string. */
Coding Platforms(codechef,codeforces,etc)/GeeksforGeeks/Reversing_the_vowels.cpp:22
↓ 2 callersFunctionkth
All Algorithms/Graph Algorithm/LCA.cpp:25
↓ 2 callersFunctionlca
All Algorithms/Graph Algorithm/LCA.cpp:18
↓ 2 callersFunctionmax_segtree
All Algorithms/Graph Algorithm/SegmentTree(max-query).cpp:112
↓ 2 callersFunctionminnode
DSA 450/Binary Search Tree/Bst-implementaion.cpp:128
↓ 2 callersFunctionmodInverse
Returns n^(-1) mod p
Coding Platforms(codechef,codeforces,etc)/Codeforces/1228D.cpp:34
↓ 2 callersMethodpeek
All Data Structures/Queues/ImplementCircularQueue.cpp:51
↓ 2 callersFunctionprintArr
function to print array
Basic Programming/BubbleSort.cpp:23
↓ 2 callersFunctionprintArray
All Data Structures/Sorting/CountSort.cpp:5
↓ 2 callersFunctionprintArray
Print the tree
All Data Structures/Queues/PriorityQueue.cpp:64
↓ 2 callersFunctionprintArray
All Data Structures/Arrays/20) Rearrange array in alternating positive & negative items.cpp:42
↓ 2 callersFunctionprintArray
Prints the array
All Algorithms/Sorting Algorithm/heap_sort.cpp:48
↓ 2 callersFunctionprintArray
Print Sorted array to console
All Algorithms/Sorting Algorithm/tim_sort.cpp:90
↓ 2 callersFunctionprintArray
All Algorithms/Sorting Algorithm/INSERTION SORT.cpp:21
↓ 2 callersFunctionprintArray
DSA 450/Arrays/20.Rearrange array in alternating positive & negative.cpp:43
↓ 2 callersFunctionprintArray
DSA 450/Arrays/1. Reverse the Array.cpp:16
↓ 2 callersFunctionprintDeque
All Data Structures/Queues/double-ended_queue(deque) .c:129
↓ 2 callersFunctionprintStack
to print contents of stack
All Data Structures/Stack/Sort_stack_using_recursion.cpp:76
↓ 2 callersFunctionprintStack
All Data Structures/Stack/reverseStack.cpp:29
↓ 2 callersFunctionprint_array
All Algorithms/Bubble_sort.cpp:18
↓ 2 callersFunctionpushFront
All Data Structures/Queues/double-ended_queue(deque) .c:67
↓ 2 callersFunctionpushRear
All Data Structures/Queues/double-ended_queue(deque) .c:82
↓ 2 callersFunctionresize
All Data Structures/Queues/double-ended_queue(deque) .c:42
↓ 2 callersMethodrobRange
(int[] num, int start, int end)
Coding Platforms(codechef,codeforces,etc)/LeetCode/house robber2.java:10
↓ 2 callersFunctionrtrim
Coding Platforms(codechef,codeforces,etc)/HackerRank/Pairs.cpp:80
↓ 2 callersFunctionrtrim
Coding Platforms(codechef,codeforces,etc)/HackerRank/leftRotation.cpp:83
↓ 2 callersFunctionsearch
All Algorithms/String algorithms/Boyer Moore Algorithm.cpp:22
↓ 2 callersMethodshow
All Data Structures/Singly_LL/main.cpp:91
↓ 2 callersFunctionsplit
Coding Platforms(codechef,codeforces,etc)/HackerRank/Pairs.cpp:91
↓ 2 callersFunctionsplit
Coding Platforms(codechef,codeforces,etc)/HackerRank/leftRotation.cpp:94
↓ 2 callersFunctionsplit
Coding Platforms(codechef,codeforces,etc)/HackerRank/SubArrayDiv.Cpp:79
↓ 2 callersFunctionsplit
Coding Platforms(codechef,codeforces,etc)/HackerRank/Grid_Search/c++/solution.cpp:129
↓ 2 callersFunctionstrassenMultiply
All Algorithms/strassen.cpp:137
↓ 2 callersFunctionswap
Function to swap position of two elements
All Data Structures/Queues/PriorityQueue.cpp:8
↓ 2 callersFunctionswap
function to swap two elements
All Algorithms/Sorting Algorithm/quick_sort.cpp:4
↓ 2 callersFunctionswap
All Algorithms/Sorting Algorithm/wave_sort/wave_sort.cpp:4
↓ 2 callersFunctionswap
All Algorithms/Sorting Algorithm/DNF_sort/dnf_sort.cpp:4
↓ 2 callersFunctionswap
All Algorithms/Sorting Algorithm/Quick_sort/Quick_sort.cpp:4
← previousnext →101–200 of 2,161, ranked by callers