MCPcopy Create free account

hub / github.com/ManishK4514/Strivers-A2Z-DSA-Sheet / functions

Functions1,060 in github.com/ManishK4514/Strivers-A2Z-DSA-Sheet

⨍ Functions 1,060◇ Types & classes 500
↓ 464 callersMethodadd
(int val)
Heap/Hard Problems/Kth largest element in a stream of running integers.java:44
↓ 288 callersMethodget
(int key)
Stack/Medium Problems/LRU cache.java:31
↓ 141 callersMethodpeek
()
Heap/Implementation/Implementation Of Heap.java:51
↓ 81 callersMethodput
(int key, int value)
Stack/Medium Problems/LRU cache.java:41
↓ 78 callersMethodremove
()
Queue/Implementation/Implement Queue using Arrays.java:47
↓ 55 callersMethodisEmpty
()
Heap/Implementation/Implementation Of Heap.java:121
↓ 53 callersMethodtoString
(int row, int col)
Graph/Problems on BFS & DFS/Number of Distinct Islands.java:50
↓ 47 callersMethodpush
(int value)
Stack/Implementation/Implementation Of Stack by ArrayList.java:18
↓ 41 callersMethodempty
()
Stack/Implementation/Implement Stack using Queue.java:36
↓ 41 callersMethodprint
(int[] arr, int n)
Recursion/Subsequences Pattern/Generate all binary strings.java:49
↓ 40 callersMethodpop
()
Stack/Implementation/Implementation Of Stack by ArrayList.java:23
↓ 20 callersMethodisEmpty
()
Stack/Implementation/Implementation Of Stack by ArrayList.java:13
↓ 14 callersMethodempty
()
Queue/Implementation/Implement Queue using Stack..java:54
↓ 10 callersMethodnext
()
Binary Search Trees/Practice Problems/Binary Search Tree Iterator.java:77
↓ 9 callersMethodhasNext
()
Binary Search Trees/Practice Problems/Binary Search Tree Iterator.java:83
↓ 8 callersMethodinsert
(int value)
Heap/Implementation/Implementation Of Heap.java:18
↓ 8 callersMethodpush
(int val)
Stack/Medium Problems/Implement Min Stack.java:26
↓ 8 callersMethodreverse
(int x)
Basic Maths Programs/Reverse Integer.java:14
↓ 7 callersMethodget
(int index)
LinkedList/Implementation of LinkedList.java:139
↓ 6 callersMethodfindUPar
(int node)
Graph/MinimumSpanningTree & Disjoint Set and Problems/Disjoint Set [Union by Size].java:52
↓ 6 callersMethodfindUPar
(int node)
Graph/MinimumSpanningTree & Disjoint Set and Problems/Disjoint Set [Union by Rank].java:125
↓ 6 callersMethodpush
(int x)
Queue/Implementation/Implement Queue using Stack..java:20
↓ 6 callersMethodunionByRank
(int u, int v)
Graph/MinimumSpanningTree & Disjoint Set and Problems/Disjoint Set [Union by Rank].java:131
↓ 6 callersMethodunionBySize
(int u, int v)
Graph/MinimumSpanningTree & Disjoint Set and Problems/Disjoint Set [Union by Size].java:58
↓ 5 callersMethodfindUPar
(int node)
Graph/MinimumSpanningTree & Disjoint Set and Problems/Making a Large Island.java:36
↓ 5 callersMethodinsertLast
(int value)
LinkedList/Implementation of LinkedList.java:39
↓ 5 callersMethodpop
()
Stack/Medium Problems/Implement Min Stack.java:37
↓ 5 callersMethodpop
()
Queue/Implementation/Implement Queue using Stack..java:24
↓ 5 callersMethodreverse
(ListNode head)
LinkedList/Medium/Reverse a LinkedList [Recursive].java:12
↓ 4 callersMethodadd
(int value)
Queue/Implementation/Implement Queue using Arrays.java:37
↓ 4 callersMethodadd
(int value)
Queue/Implementation/Implement Circular Queue using Array.java:22
↓ 4 callersMethoddfs
(int row, int col, int n, int m, char[][] board, int[][] vis, int[] delRow, int[] delCol)
Graph/Problems on BFS & DFS/Surrounded Regions (dfs).java:34
↓ 4 callersMethodfindUPar
(int node)
Graph/MinimumSpanningTree & Disjoint Set and Problems/Kruskal’s Algorithm – Minimum Spanning Tree.java:40
↓ 4 callersMethodfindUPar
(int node)
Graph/MinimumSpanningTree & Disjoint Set and Problems/Number of Islands – II.java:36
↓ 4 callersMethodgetParent
(int index)
Heap/Implementation/Implementation Of Heap.java:116
↓ 4 callersMethodinsert
(int value)
LinkedList/Implementation Of Circular LinkedList.java:10
↓ 4 callersMethodinsertAfterHead
(Node node)
Stack/Medium Problems/LRU cache.java:67
↓ 4 callersMethodisEmpty
()
Stack/Implementation/Implementation of Stack by Linked List.java:19
↓ 4 callersMethodisEmpty
()
Queue/Implementation/Implement queue using Linkedlist.java:14
↓ 4 callersMethodisLeaf
(Node node)
Binary Trees/Medium Problems/Boundary Traversal of Binary Tree.java:15
↓ 4 callersMethodnext
()
Binary Search Trees/Practice Problems/Two Sum In BST - Check if there exists a pair with Sum K.java:33
↓ 4 callersMethodpush
(int a)
Stack/Implementation/Implement Stack using Arrays.java:28
↓ 4 callersMethodpush
(int value)
Stack/Implementation/Implementation of Stack by Linked List.java:23
↓ 4 callersMethodpush
(int value)
Queue/Implementation/Implement queue using Linkedlist.java:18
↓ 3 callersMethodInsertatFirst
(int value, ListNode head)
LinkedList/Easy LL/Insert a node in LinkedList.java:28
↓ 3 callersMethodaddNum
(int num)
Heap/Hard Problems/Find Median from Data Stream.java:41
↓ 3 callersMethoddeleteNode
(Node node)
Stack/Medium Problems/LRU cache.java:74
↓ 3 callersMethodfindUPar
(int node)
Graph/MinimumSpanningTree & Disjoint Set and Problems/Accounts Merge.java:71
↓ 3 callersMethodfindUPar
(int node)
Graph/MinimumSpanningTree & Disjoint Set and Problems/Most stones removed with same rows or columns.java:48
↓ 3 callersMethodhelper
(Node root)
Binary Search Trees/Practice Problems/Delete a Node in Binary Search Tree.java:70
↓ 3 callersMethodinsertFirst
(int value)
LinkedList/Implementation of LinkedList.java:27
↓ 3 callersMethodisEmpty
()
Queue/Implementation/Implement Queue using Arrays.java:32
↓ 3 callersMethodisEmpty
()
Queue/Implementation/Implement Circular Queue using Array.java:12
↓ 3 callersMethodpushAll
(Node root)
Binary Search Trees/Practice Problems/Two Sum In BST - Check if there exists a pair with Sum K.java:40
↓ 3 callersMethodswap
(int a,int b)
Arrays/Hard/Merge two sorted arrays without extra space.java:36
↓ 2 callersMethodPrintList
(ListNode head)
LinkedList/Easy LL/Insert a node in LinkedList.java:19
↓ 2 callersMethodXorOfAnyInteger
(int n)
Bit Manipulation/Interview Problems/Find xor of numbers from L to R.java:13
↓ 2 callersMethodatMost
(int[] nums, int k)
Sliding Window/Hard Problems/Subarrays with K Different Integers.java:41
↓ 2 callersMethodcheckPrime
(int n)
Bit Manipulation/Advanced Maths/Print Prime Factors of a Number.java:23
↓ 2 callersMethodcompare
(Item a, Item b)
Greedy/Easy Problems/Fractional Knapsack Problem.java:46
↓ 2 callersMethodcompare
(Job a, Job b)
Greedy/Medium or Hard Problems/Job sequencing Problem.java:34
↓ 2 callersMethoddelete
(int index)
Heap/Implementation/Implementation Of Heap.java:28
↓ 2 callersMethoddfs
(ArrayList<ArrayList<Integer>> adj, int[] vis, Stack<Integer> st, int node)
Graph/Other Algorithms/Kosaraju’s Algorithm.java:28
↓ 2 callersMethoddisplay
()
LinkedList/Implementation of LinkedList.java:69
↓ 2 callersMethoddisplay
()
LinkedList/Implementation Of Doubly LinkedList.java:69
↓ 2 callersMethodfindMedian
()
Heap/Hard Problems/Find Median from Data Stream.java:57
↓ 2 callersMethodfindUPar
(int node)
Graph/MinimumSpanningTree & Disjoint Set and Problems/Number of operations to make network connected.java:38
↓ 2 callersMethodfindUPar
(int node)
Graph/MinimumSpanningTree & Disjoint Set and Problems/Number of Provinces - Disjoint Set.java:29
↓ 2 callersMethodfixHeapAbove
(int index)
Heap/Implementation/Implementation Of Heap.java:93
↓ 2 callersMethodgetChild
(int index, boolean left)
Heap/Implementation/Implementation Of Heap.java:126
↓ 2 callersMethodinsert
(int after, int value)
LinkedList/Implementation Of Doubly LinkedList.java:54
↓ 2 callersMethodinsertFirst
(int value)
LinkedList/Implementation Of Doubly LinkedList.java:14
↓ 2 callersMethodisAllStars
(String p, int idx)
Dynamic Programming/DP on Strings/Wildcard Matching (DP-34).java:208
↓ 2 callersMethodlargestRectangleArea
(int[] heights)
Stack/Monotonic Stack/Maximal Rectangle.java:31
↓ 2 callersMethodmerge
(int[] nums, int low, int mid, int high)
Arrays/Hard/Reverse Pairs.java:22
↓ 2 callersMethodprintHeap
()
Heap/Implementation/Implementation Of Heap.java:103
↓ 2 callersMethodprintInorder
(Node root)
Binary Search Trees/Practice Problems/Recover Binary Search Tree.java:55
↓ 2 callersMethodpushAll
(Node root)
Binary Search Trees/Practice Problems/Binary Search Tree Iterator.java:87
↓ 2 callersMethodreverse
(Node head)
LinkedList/Medium/Add 1 to a number represented by LL.java:16
↓ 2 callersMethodsearch
(int[] arr, int target, boolean findStartIndex)
Binary Search/1D Array/Find the first or last occurrence of a given number in a sorted array.java:24
↓ 2 callersMethodsearch
(int[] arr, int target, boolean findStartIndex)
Binary Search/1D Array/Count occurrences of a number in a sorted array with duplicates.java:21
↓ 2 callersMethodswap
(int[] nums, int low, int high)
Arrays/Medium/Sort Colors(sort 0's, 1's & 2's).java:27
↓ 1 callersMethodAllPossibleStrings
(String str)
Recursion/Subsequences Pattern/Print all subsequences of a String OR Power Set.java:35
↓ 1 callersMethodFindMaxSum
(int arr[], int n)
Dynamic Programming/1D DP/House Robber (DP 6).java:83
↓ 1 callersMethodInsertatIndex
(int value, int index, ListNode head)
LinkedList/Easy LL/Insert a node in LinkedList.java:51
↓ 1 callersMethodInsertatLast
(int value, ListNode head)
LinkedList/Easy LL/Insert a node in LinkedList.java:36
↓ 1 callersMethodLargestSubarray
(int[] nums)
Arrays/Hard/Largest Subarray with 0 Sum.java:36
↓ 1 callersMethodLongestBitonicSequence
(int[] nums)
Dynamic Programming/DP on LIS/Longest Bitonic Subsequence (DP-46).java:112
↓ 1 callersMethodPrintAllDivisors
(int n)
Bit Manipulation/Advanced Maths/All Divisors of a Number.java:7
↓ 1 callersMethodProcessScheduling
(Process[] processes, int n)
Greedy/Medium or Hard Problems/Program for Shortest Job First (or SJF) CPU Scheduling.java:36
↓ 1 callersMethodaccountsMerge
(List<List<String>> accounts)
Graph/MinimumSpanningTree & Disjoint Set and Problems/Accounts Merge.java:93
↓ 1 callersMethodaddLeaves
(Node root, ArrayList<Integer> res)
Binary Trees/Medium Problems/Boundary Traversal of Binary Tree.java:39
↓ 1 callersMethodaddLeftBoundry
(Node root, ArrayList<Integer> res)
Binary Trees/Medium Problems/Boundary Traversal of Binary Tree.java:18
↓ 1 callersMethodaddNeighbours
(ArrayList<Integer> nums, Queue<Integer> q, boolean[] vis)
Graph/Learning/Breadth First Search (BFS) in Graph.java:47
↓ 1 callersMethodaddRightBoundry
(Node root, ArrayList<Integer> res)
Binary Trees/Medium Problems/Boundary Traversal of Binary Tree.java:26
↓ 1 callersMethodarmstrongNumber
(int n)
Basic Maths Programs/Armstrong number.java:15
↓ 1 callersMethodarrayRankTransform
(int[] arr)
Heap/Medium Problems/Replace each array element by its corresponding rank.java:33
↓ 1 callersMethodarticulationPoints
(int n,ArrayList<ArrayList<Integer>> adj)
Graph/Other Algorithms/Articulation Point.java:56
↓ 1 callersMethodasteroidCollision
(int[] asteroids)
Stack/Monotonic Stack/Asteroid Collision.java:28
↓ 1 callersMethodbeautySum
(String s)
Strings/medium/Sum of Beauty of all substring.java:57
next →1–100 of 1,060, ranked by callers