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
↓ 1 callersMethodfindMaxElement
(int[] arr)
Arrays/Easy/Largest Element in an Array.java:19
↓ 1 callersMethodfindMaxSum
(int arr[], int n)
Dynamic Programming/1D DP/Maximum sum of non-adjacent elements (DP 5).java:84
↓ 1 callersMethodfindMedianSortedArrays
(int[] nums1, int[] nums2, int m, int n)
Binary Search/Search Space/Median of two sorted arrays.java:28
↓ 1 callersMethodfindMinSizeSubsequence
(String str1, String str2)
Sliding Window/Hard Problems/Minimum Window Subsequence.java:30
↓ 1 callersMethodfindMissingRepeating
(int[] arr, int n)
Arrays/Hard/Find the repeating and missing number.java:22
↓ 1 callersMethodfindNumberOfLIS
(int[] nums)
Dynamic Programming/DP on LIS/Longest Bitonic Subsequence (DP-46).java:25
↓ 1 callersMethodfindOrder
(String [] dict, int n, int k)
Graph/Topo Sort and Problems/Alien dictionary.java:72
↓ 1 callersMethodfindOrder
(int numCourses, int[][] prerequisites)
Graph/Topo Sort and Problems/Course Schedule – II.java:38
↓ 1 callersMethodfindPages
(int[]arr,int N,int students)
Binary Search/Search Space/Book Allocation Problem.java:49
↓ 1 callersMethodfindPath
(int[][] maze, int n)
Recursion/Hard Problems/Rat in a Maze.java:64
↓ 1 callersMethodfindPath
(int[][] matrix, int row, int col, int n, int[][] dp)
Dynamic Programming/2D, 3D DP and DP on Grids/Minimum And Maximum Falling Path Sum (DP-12).java:134
↓ 1 callersMethodfindPeakElement
(int[] nums, int n)
Binary Search/1D Array/Find peak element.java:23
↓ 1 callersMethodfindPeakGrid
(int[][] matrix)
Binary Search/2D Arrays/Find Peak Element II.java:29
↓ 1 callersMethodfindPlatform
(int arr[], int dep[])
Greedy/Medium or Hard Problems/Minimum number of platforms required for a railway.java:29
↓ 1 callersMethodfindRightHeight
(Node root)
Binary Trees/Hard Problems/Count total Nodes in a COMPLETE Binary Tree.java:77
↓ 1 callersMethodfindSecondMaxElement
(int[] arr)
Arrays/Easy/Second Largest Element in the Array.java:22
↓ 1 callersMethodfindSequences
(String startWord, String targetWord, String[] wordList)
Graph/Problems on BFS & DFS/Word Ladder II.java:31
↓ 1 callersMethodfindStockSpan
(int[] arr)
Stack/Monotonic Stack/Stock span problem.java:46
↓ 1 callersMethodfindSubsetSum
(int idx, int[] arr, List<Integer> ans, int sum)
Recursion/Subsequences Pattern/Subset Sum-I.java:55
↓ 1 callersMethodfindTarget
(Node root, int k)
Binary Search Trees/Practice Problems/Two Sum In BST - Check if there exists a pair with Sum K.java:93
↓ 1 callersMethodfindTargetSumWays
(int[] nums, int target)
Dynamic Programming/DP on Subsequences/Target Sum (DP – 21).java:137
↓ 1 callersMethodfindTheCity
(int n, int[][] edges, int distanceThreshold)
Graph/Shortest Path Algorithms and Problems/Find the City With the Smallest Number of Neighbors at a Threshold Distance.java:40
↓ 1 callersMethodfindTime
(int[] piles, int i)
Binary Search/Search Space/Koko Eating Bananas.java:26
↓ 1 callersMethodfindTwoSum
(int[] nums, int target)
Arrays/Medium/Two Sum.java:38
↓ 1 callersMethodfindUnion
(int arr1[], int arr2[], int n, int m)
Arrays/Easy/Union of two Sorted Array.java:40
↓ 1 callersMethodfindUniqueSubset
(int idx, int[] arr, ArrayList<ArrayList<Integer>> ans, ArrayList<Integer> ds)
Recursion/Subsequences Pattern/Subset Sum-II.java:21
↓ 1 callersMethodfindXorFromLtoR
(int l, int r)
Bit Manipulation/Interview Problems/Find xor of numbers from L to R.java:30
↓ 1 callersMethodfixHeapBelow
(int index, int lastHeapIndex)
Heap/Implementation/Implementation Of Heap.java:59
↓ 1 callersMethodflatten
(Node root)
Binary Trees/Hard Problems/Flatten Binary Tree to LinkedList.java:33
↓ 1 callersMethodfloodFill
(int[][] image, int sr, int sc, int color)
Graph/Problems on BFS & DFS/Flood fill.java:52
↓ 1 callersMethodfloor
(Node root, int x)
Binary Search Trees/Practice Problems/Floor in a Binary Search Tree.java:46
↓ 1 callersMethodfourSum
(int[] nums, int target)
Arrays/Hard/4-Sum Problem.java:29
↓ 1 callersMethodfractionalKnapsack
(int w, Item arr[], int n)
Greedy/Easy Problems/Fractional Knapsack Problem.java:58
↓ 1 callersMethodfrequencySort
(String s)
Strings/medium/Sort Characters by frequency.java:35
↓ 1 callersMethodfunc
(int index, String s, List<String> path, List<List<String>> res)
Recursion/Hard Problems/Palindrome Partitioning.java:32
↓ 1 callersMethodgenerate
(int numRows)
Arrays/Hard/Pascal’s Triangle.java:30
↓ 1 callersMethodgenerate
(List<String> ans, int open, int close, String str)
Recursion/Subsequences Pattern/Generate Paranthesis.java:19
↓ 1 callersMethodgenerate
(int[] arr, int n, int i)
Recursion/Subsequences Pattern/Generate all binary strings.java:55
↓ 1 callersMethodgenerateParenthesis
(int n)
Recursion/Subsequences Pattern/Generate Paranthesis.java:31
↓ 1 callersMethodgetNthRoot
(int n, int m)
Binary Search/Search Space/Find the Nth root of a number using binary search.java:32
↓ 1 callersMethodgetPath
(Node root, ArrayList<Integer> res, int target)
Binary Trees/Hard Problems/Root to Node Path in Binary Tree.java:72
↓ 1 callersMethodgetPath
(Node root, ArrayList<ArrayList<Integer>> res, ArrayList<Integer> path)
Binary Trees/Hard Problems/Root to Leaf Paths.java:41
↓ 1 callersMethodheight
(Node root, int[] diameter)
Binary Trees/Medium Problems/Diameter of Binary Tree.java:29
↓ 1 callersMethodhelper
(char[][] board, List<List<String>> allBoards, int col)
Recursion/Hard Problems/N Queen.java:67
↓ 1 callersMethodhelper
(String s, int i, int j, int[][] dp)
Dynamic Programming/DP on Strings/Longest Palindromic Subsequence.java:53
↓ 1 callersMethodhelper
(Node root, long min , long max)
Binary Search Trees/Practice Problems/Check if a tree is a BST or BT.java:57
↓ 1 callersMethodimmediateSmaller
(int arr[], int n)
Stack/Monotonic Stack/Next Smaller Element.java:28
↓ 1 callersMethodinOrderTraversal
(Node node)
Binary Trees/Traversals/Inorder Traversal of Binary Tree.java:29
↓ 1 callersMethodinfixToPostfix
(String exp)
Stack/Infix, Prefix & Postfix/Infix to Prefix Conversion Using Stack.java:30
↓ 1 callersMethodinfixToPostfix
(String exp)
Stack/Infix, Prefix & Postfix/Infix to Postfix Conversion Using Stack.java:42
↓ 1 callersMethodinorder
(Node root)
Binary Search Trees/Practice Problems/Recover Binary Search Tree.java:27
↓ 1 callersMethodinorderPredecessor
(Node root, Node p)
Binary Search Trees/Practice Problems/Inorder Predecessor of Binary Search Tree.java:36
↓ 1 callersMethodinorderSuccessor
(Node root, Node p)
Binary Search Trees/Practice Problems/Inorder Successor of Binary Search Tree.java:35
↓ 1 callersMethodinorderTraversal
(Node root)
Binary Trees/Hard Problems/Morris Inorder Traversal of a Binary Tree.java:29
↓ 1 callersMethodinorderTraversal
(Node root)
Binary Trees/Traversals/Iterative Inorder Traversal of Binary Tree.java:32
↓ 1 callersMethodinsertIntoBST
(Node root, int val)
Binary Search Trees/Practice Problems/Insert a given Node in Binary Search Tree.java:35
↓ 1 callersMethodinsertLast
(int value)
LinkedList/Implementation Of Doubly LinkedList.java:25
↓ 1 callersMethodinsertionSort
(int[] arr, int n, int i)
Sorting Algorithms/Recursive Insertion Sort.java:8
↓ 1 callersMethodinsertionSort
(int[] arr)
Sorting Algorithms/Insertion Sort.java:9
↓ 1 callersMethodisAnagram
(String s, String t)
Strings/easy/Check if two strings are anagram of each other.java:28
↓ 1 callersMethodisBalanced
(Node root)
Binary Trees/Medium Problems/Check if the Binary tree is height-balanced or not.java:38
↓ 1 callersMethodisBipartite
(int n, ArrayList<ArrayList<Integer>>adj)
Graph/Problems on BFS & DFS/Bipartite Graph (DFS) & (BFS).java:108
↓ 1 callersMethodisCompatible
(int[] inp, int dist, int cows)
Binary Search/Search Space/Aggressive Cows.java:17
↓ 1 callersMethodisCycle
(int n, ArrayList<ArrayList<Integer>> adj)
Graph/Problems on BFS & DFS/Cycle Detection in unirected Graph (bfs).java:67
↓ 1 callersMethodisCycle
(int n, ArrayList<ArrayList<Integer>> adj)
Graph/Problems on BFS & DFS/Cycle Detection in undirected Graph (dfs).java:53
↓ 1 callersMethodisCyclic
(int n, ArrayList<ArrayList<Integer>> adj)
Graph/Topo Sort and Problems/Cycle Detection in Directed Graph (BFS).java:45
↓ 1 callersMethodisCyclic
(int n, ArrayList<ArrayList<Integer>> adj)
Graph/Problems on BFS & DFS/Cycle Detection in Directed Graph (DFS).java:56
↓ 1 callersMethodisEmpty
()
Stack/Implementation/Implement Stack using Arrays.java:55
↓ 1 callersMethodisFull
()
Heap/Implementation/Implementation Of Heap.java:111
↓ 1 callersMethodisFull
()
Queue/Implementation/Implement Circular Queue using Array.java:17
↓ 1 callersMethodisIsomorphic
(String s, String t)
Strings/easy/Isomorphic String.java:28
↓ 1 callersMethodisMatch
(String s, String p)
Dynamic Programming/DP on Strings/Wildcard Matching (DP-34).java:216
↓ 1 callersMethodisNStraightHand
(int[] hand, int groupSize)
Heap/Medium Problems/Hands of Straights.java:30
↓ 1 callersMethodisPalindrome
(int x)
Basic Maths Programs/Palindrome.java:16
↓ 1 callersMethodisPalindrome
(String s, int start, int end)
Recursion/Hard Problems/Palindrome Partitioning.java:45
↓ 1 callersMethodisPossible
(int a, int b)
Binary Trees/Hard Problems/Unique Binary Tree Requirements.java:22
↓ 1 callersMethodisSafe
(int row, int col, char[][] board)
Recursion/Hard Problems/N Queen.java:19
↓ 1 callersMethodisSameTree
(Node p, Node q)
Binary Trees/Medium Problems/Check if two trees are identical or not.java:31
↓ 1 callersMethodisSubsetSum
(int n, int arr[], int sum)
Dynamic Programming/DP on Subsequences/Subset sum equal to target (DP- 14).java:98
↓ 1 callersMethodisSumProperty
(Node root)
Binary Trees/Hard Problems/Check for Children Sum Property.java:41
↓ 1 callersMethodisSymmetric
(Node root)
Binary Trees/Medium Problems/Symmetric Binary Tree.java:24
↓ 1 callersMethodisSymmetricHelp
(Node left, Node right)
Binary Trees/Medium Problems/Symmetric Binary Tree.java:27
↓ 1 callersMethodisValid
(String str)
Stack/Easy Problems/Valid Parentheses.java:30
↓ 1 callersMethodisValid
(String s1, String s2)
Dynamic Programming/DP on LIS/Longest String Chain (DP- 45).java:36
↓ 1 callersMethodisValidBST
(Node root)
Binary Search Trees/Practice Problems/Check if a tree is a BST or BT.java:62
↓ 1 callersMethodjump
(int[] arr)
Greedy/Medium or Hard Problems/Minimum number of jumps or Jump Game 2.java:24
↓ 1 callersMethodknapSack
(int N, int W, int val[], int wt[])
Dynamic Programming/DP on Subsequences/Unbounded Knapsack (DP-23).java:109
↓ 1 callersMethodknapSack
(int W, int wt[], int val[], int n)
Dynamic Programming/DP on Subsequences/0_1 Knapsack (DP – 19).java:106
↓ 1 callersMethodkosaraju
(int V, ArrayList<ArrayList<Integer>> adj)
Graph/Other Algorithms/Kosaraju’s Algorithm.java:39
↓ 1 callersMethodkthSmallest
(int[] arr, int k)
Heap/Medium Problems/Kth Smallest Element in an Array.java:30
↓ 1 callersMethodkthSmallest
(Node root, int k)
Binary Search Trees/Practice Problems/Added Find K-th smallest or largest element in BST.java:58
↓ 1 callersMethodkthelement
(int array1[], int array2[], int m, int n, int k)
Binary Search/1D Array/Find minimum in Rotated Sorted Array.java:40
↓ 1 callersMethodkthelement
(int array1[], int array2[], int m, int n, int k)
Binary Search/1D Array/Find kth element of two sorted arrays.java:40
↓ 1 callersMethodlargestDivisibleSubset
(int[] nums)
Dynamic Programming/DP on LIS/Longest Divisible Subset (DP-44).java:29
↓ 1 callersMethodlargestIsland
(int[][] grid)
Graph/MinimumSpanningTree & Disjoint Set and Problems/Making a Large Island.java:58
↓ 1 callersMethodlargestOddNumber
(String nums)
Strings/easy/Largest odd number in a string.java:24
↓ 1 callersMethodlargestRectangleArea
(int[] heights)
Stack/Monotonic Stack/Largest rectangle in a histogram.java:26
↓ 1 callersMethodlargestRectangleArea
(int[] heights)
Dynamic Programming/DP on Squares/Maximum Rectangle Area with all 1’s (DP-55).java:36
↓ 1 callersMethodlcmAndHcf
(long A , long B)
Basic Maths Programs/LCM & HCF.java:19
↓ 1 callersMethodlcs
(String s1, String s2)
Dynamic Programming/DP on Strings/Print Longest Common Subsequence.java:46
← previousnext →201–300 of 1,060, ranked by callers