MCPcopy Create free account

hub / github.com/Ayu-99/Data-Structures / functions

Functions807 in github.com/Ayu-99/Data-Structures

⨍ Functions 807◇ Types & classes 444
↓ 80 callersFunctionmax
heightOfABTree.cpp:2
↓ 78 callersMethodlength
Linked List/Convert Sorted List to BST.cpp:41
↓ 60 callersMethodtop
Leetcode Challenge/May/C++/Implement Stack using Queues.cpp:37
↓ 51 callersMethodempty
Leetcode Challenge/May/C++/Implement Stack using Queues.cpp:57
↓ 48 callersMethodpop
Leetcode Challenge/March/C++/Maximum Frequency Stack.cpp:11
↓ 48 callersMethodpop
Stacks and Queues/Stack using LL.cpp:122
↓ 48 callersMethodpush
Stacks and Queues/Stack using LL.cpp:109
↓ 47 callersMethodpush
Leetcode Challenge/March/C++/Maximum Frequency Stack.cpp:7
↓ 41 callersMethodget
Get the value of the index-th node in the linked list. If the index is invalid, return -1. */
Linked List/Design Linked List.cpp:57
↓ 35 callersFunctiondfs
Graphs/Islands.cpp:22
↓ 34 callersFunctionhelper
(last, n)
Leetcode July Challenge/Python/Count Vowels Permutation.py:6
↓ 33 callersMethodadd
Leetcode Challenge/April/C++/Kth Largest Element in a Stream.cpp:15
↓ 31 callersMethodfront
Stacks and Queues/Queue using LL.cpp:141
↓ 20 callersMethodtop
Stacks and Queues/Stack using LL.cpp:134
↓ 17 callersMethodfind
Leetcode Challenge/January/Design Add and Search Words Data Structure.cpp:53
↓ 14 callersFunctionaddEdge
Graphs/Beginners/Adjacency Matrix.cpp:5
↓ 14 callersFunctionsolve
Graphs/3 cycle.cpp:22
↓ 13 callersMethodpop
Leetcode Challenge/May/C++/Implement Stack using Queues.cpp:17
↓ 10 callersMethodisEmpty
Stacks and Queues/Stack using LL.cpp:101
↓ 10 callersMethodpush
Leetcode Challenge/May/C++/Implement Stack using Queues.cpp:10
↓ 8 callersMethodinsert
Leetcode Challenge/January/Maximum XOR of Two Numbers in an Array.cpp:18
↓ 7 callersFunctionaddEdge
Graphs/Beginners/Adjacency List.cpp:5
↓ 7 callersMethodisEmpty
Stacks and Queues/Queue.cpp:55
↓ 7 callersMethodpeek
Leetcode Challenge/december2k22/Implement Queue using Stacks.cpp:27
↓ 6 callersMethodpeek
Stacks and Queues/Stack Implementation using Arrays.cpp:37
↓ 6 callersMethodpush
Leetcode Challenge/december2k22/Implement Queue using Stacks.cpp:9
↓ 6 callersFunctionswap
HashMaps/Minimum Number Of Swaps.cpp:7
↓ 5 callersMethodenqueue
Stacks and Queues/Queue.cpp:13
↓ 5 callersFunctionfindParent
Graphs/Kruskals.cpp:52
↓ 5 callersMethodinsert
Leetcode Challenge/December/Stream of Characters.cpp:16
↓ 5 callersMethodpop
Leetcode Challenge/december2k22/Implement Queue using Stacks.cpp:21
↓ 5 callersMethodpop
Stacks and Queues/Stack Implementation using Arrays.cpp:24
↓ 5 callersMethodpush
Stacks and Queues/Stack Implementation using Arrays.cpp:11
↓ 4 callersFunctionDFS
Graphs/All Connected Components.cpp:63
↓ 4 callersMethoddequeue
Stacks and Queues/Queue.cpp:25
↓ 4 callersMethodempty
Leetcode Challenge/december2k22/Implement Queue using Stacks.cpp:31
↓ 4 callersMethodisPalindrome
(String s)
Check If String Is Palindrome After At Most One Deletion.java:12
↓ 4 callersFunctionlength
Recursion/Pair Star.cpp:1
↓ 3 callersMethodisIsomorphic
(String s, String t)
Check If Two Strings Are Isomorphic.java:5
↓ 3 callersFunctionmergeSort
Merge Sort in LL.cpp:84
↓ 3 callersMethodswap
(int i, int j, int[] nums)
Sorting/Sort colors.java:2
↓ 2 callersFunctiondfs
(i,j)
Graphs/Count Sub Islands.py:7
↓ 2 callersFunctionhelper
Find a node in LL.cpp:40
↓ 2 callersFunctioninitialize
Graphs/Largest Piece.cpp:23
↓ 2 callersFunctioninitialize
Graphs/Coding Ninjas.cpp:28
↓ 2 callersMethodisEmpty
Heap/Min Heap/Implementation.cpp:6
↓ 2 callersFunctionmerge
(array, left, mid, right)
Sorting Algorithms/Merge sort.py:1
↓ 2 callersFunctionprintArray
(array, size)
Sorting Algorithms/Merge sort.py:45
↓ 2 callersMethodreverse
Leetcode Challenge/December/Reorder List.cpp:13
↓ 2 callersMethodreverse_list
(self, head)
Linked List/Remove Nodes From Linked List.py:7
↓ 2 callersFunctionsumList
(a,n)
Greedy/Maximize sum after K negations.py:1
↓ 1 callersFunctionPerfectMatch
HashMaps/Perfect Sum Pair.cpp:48
↓ 1 callersMethodadd
(int n)
Leetcode Challenge/April/Java/Kth Largest Element in a Stream.java:12
↓ 1 callersMethodbacktrack
( List<List<Integer>> answer, List<Integer> tempList, int[] candidates, int to
Backtracking/Java/Combination Sum 2.java:10
↓ 1 callersFunctionbfs
Graphs/Get Path-BFS.cpp:43
↓ 1 callersMethodbinarySearch
(int x,int[][] arr)
Binary Search/Most Profit Assigning Work.java:3
↓ 1 callersMethodbinarySearch
(int[] arr, int target)
Binary Search/Java/BinarySearch.java:3
↓ 1 callersFunctionbubbleSort
(arr)
Sorting Algorithms/Bubble Sort.py:1
↓ 1 callersMethodbuildLPS
(String pattern)
Check If One String Is Rotation of Another.java:39
↓ 1 callersMethodcanEatInTime
(int piles[], int k, int h)
Leetcode Challenge/January/Java/Koko Eating Bananas.java:13
↓ 1 callersFunctioncheckRedundancy
Stacks and Queues/Check Redundant Brackets.cpp:6
↓ 1 callersMethodcombinationUtil
(List<List<Integer>> list, List<Integer> temp, int[] candidates, int start, int target)
Leetcode Challenge/February/java/Combination Sum.java:7
↓ 1 callersFunctioncountNumberOfZeros
(n)
Recursion/Count of zeroes in number.py:1
↓ 1 callersFunctioncountOfIslands
Graphs/Islands.cpp:42
↓ 1 callersFunctioncountStepsToOneHelper
Dynamic Programming/Min steps to 1.cpp:2
↓ 1 callersFunctioncreate_singly_linked_list_node
Inserting A Node at a given position in Linked List.c:28
↓ 1 callersFunctiondfs
Graphs/Largest Piece.cpp:31
↓ 1 callersFunctiondfs
Graphs/Coding Ninjas.cpp:37
↓ 1 callersMethoddfs
(self, nums, target, idx, path, ret)
Backtracking/Python/Combination Sum 2.py:7
↓ 1 callersMethoddfs2
(int[][] jobs, int idx, int[] dp, int n)
Dynamic Programming/aximum Profit in Job Scheduling.java:16
↓ 1 callersFunctiondjikstra
Graphs/Dijkstra's Algorithm.cpp:42
↓ 1 callersMethodfind
(int number)
Leetcode Feb challenge2k25/Design a Number Container System.java:18
↓ 1 callersMethodfind
(self, word)
Trie/Find the Length of the Longest Common Prefix.py:23
↓ 1 callersFunctionfindMin
(V)
Greedy/Greedy Approach to Minimum Number of Coins.py:2
↓ 1 callersFunctionfindMinVertex
Graphs/Dijkstra's Algorithm.cpp:31
↓ 1 callersFunctionfindMinVertex
Graphs/Prim's Algorithm.cpp:33
↓ 1 callersMethodfindPathsH
(self,m, n, maxMove, i, j)
Leetcode Challenge/June/Python/Out of Boundary Paths.py:6
↓ 1 callersFunctionfindRedundant
Stacks and Queues/Check Redundant Brackets.cpp:39
↓ 1 callersFunctionfindSmallest
(m,s)
Greedy/Find smallest number with given number of digits and sum of digits.py:1
↓ 1 callersMethodfindTwoUniques
(int[] nums)
Find Two Unique Numbers.java:6
↓ 1 callersFunctionfirstIndexOfNumberInArray
(a,n,x)
Recursion/First Index of element in array.py:1
↓ 1 callersMethodgetFront
Stacks and Queues/Queue.cpp:36
↓ 1 callersFunctiongetMaxCountChar
(countArray)
Greedy/Rearrange characters in a string such that no two adjacent are same.py:1
↓ 1 callersMethodgetNumberOfBouqets
(int[] bloomDay, int mid, int k)
Binary Search/Minimum Number of Days to Make m Bouquets.java:3
↓ 1 callersFunctiongetPath
Graphs/Get Path-DFS.cpp:39
↓ 1 callersFunctionheight1
heightOfABTree.cpp:7
↓ 1 callersFunctionhelper
Convert sorted array into BST.cpp:32
↓ 1 callersMethodhelper
(self, root)
Leetcode July Challenge/Python/Binary Tree Pruning.py:9
↓ 1 callersMethodhelper
(TreeNode root, List<Integer> path, int B)
Trees/Path to given node.java:16
↓ 1 callersMethodhelper
(self,root,val)
Leetcode Challenge/April/Python/Search in a Binary Search Tree.py:10
↓ 1 callersMethodhelper
(int cur, int digit, int low, int high, List<Integer> res)
Leetcode Challenge/January/Java/Sequential Digits.java:10
↓ 1 callersFunctioninit
Graphs/Beginners/Adjacency Matrix.cpp:21
↓ 1 callersMethodinorder
(TreeNode node)
Leetcode Challenge/April/Java/Increasing Order Search Tree.java:10
↓ 1 callersMethodinorderTraverse
(TreeNode root)
Binary Search Tree/Balance a Binary Search Tree.java:22
↓ 1 callersMethodinsert
Heap/Min Heap/Implementation.cpp:18
↓ 1 callersMethodinsert
(self, word)
Trie/Find the Length of the Longest Common Prefix.py:13
↓ 1 callersFunctioninsertionSort
(arr)
Sorting Algorithms/Insertion sort.py:1
↓ 1 callersFunctionisConnected
Graphs/Is Connected?.cpp:56
↓ 1 callersMethodisEmpty
Stacks and Queues/Stack Implementation using Arrays.cpp:46
↓ 1 callersMethodisPlacementPossible
(int[] positions, int m, int max)
Binary Search/Magnetic Force Between Two Balls.java:19
next →1–100 of 807, ranked by callers