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 callersMethodbellman_ford
(int V, ArrayList<ArrayList<Integer>> edges, int S)
Graph/Shortest Path Algorithms and Problems/Bellman Ford Algorithm.java:30
↓ 1 callersMethodbfsOfGraph
(int n, ArrayList<ArrayList<Integer>> adj)
Graph/Learning/Breadth First Search (BFS) in Graph.java:56
↓ 1 callersMethodbinaryTreePaths
(Node root)
Binary Trees/Hard Problems/Root to Leaf Paths.java:61
↓ 1 callersMethodbottomView
(Node root)
Binary Trees/Medium Problems/Bottom View of Binary Tree.java:77
↓ 1 callersMethodbstFromPreorder
(int[] preorder)
Binary Search Trees/Practice Problems/Construct a BST from a preorder traversal.java:59
↓ 1 callersMethodbubbleSort
(int[] arr)
Sorting Algorithms/Bubble Sort.java:10
↓ 1 callersMethodbuildTree
(int[] preorder, int[] inorder)
Binary Trees/Hard Problems/Construct Binary Tree from inorder and preorder.java:53
↓ 1 callersMethodbuildTree
(int[] inorder, int[] postorder)
Binary Trees/Hard Problems/Construct the Binary Tree from Postorder and Inorder Traversal.java:53
↓ 1 callersMethodcanFinish
(int numCourses, int[][] prerequisites)
Graph/Topo Sort and Problems/Course Schedule - I.java:52
↓ 1 callersMethodcanJump
(int[] nums)
Greedy/Medium or Hard Problems/Jump Game.java:21
↓ 1 callersMethodcanPartition
(int[] nums)
Dynamic Programming/DP on Subsequences/Partition Equal Subset Sum (DP- 15).java:100
↓ 1 callersMethodcandy
(int[] ratings)
Greedy/Medium or Hard Problems/Candy.java:28
↓ 1 callersMethodchange
(int amount, int[] coins)
Dynamic Programming/DP on Subsequences/Coin Change 2 (DP – 22).java:118
↓ 1 callersMethodchangeTree
(Node root)
Binary Trees/Hard Problems/Children Sum Property in Binary Tree.java:54
↓ 1 callersMethodcheck
(int start, int n, ArrayList<ArrayList<Integer>>adj, int[] color)
Graph/Problems on BFS & DFS/Bipartite Graph (DFS) & (BFS).java:90
↓ 1 callersMethodcheck
(int[] phash, int[] hash)
Sliding Window/Medium Problems/Find All Anagrams in a String.java:45
↓ 1 callersMethodcheck
(int[] arr, int m, int mid)
Binary Search/Search Space/Split array – Largest Sum.java:30
↓ 1 callersMethodcheck
(int[] arr, int students, int mid)
Binary Search/Search Space/Book Allocation Problem.java:31
↓ 1 callersMethodcheckOdd
(int n)
Bit Manipulation/Easy Problems/Check if a number is odd or not.java:2
↓ 1 callersMethodcheckPower
(int n)
Bit Manipulation/Easy Problems/Check if a number is power of 2 or not.java:2
↓ 1 callersMethodcheckSetBits
(int n, int i)
Bit Manipulation/Easy Problems/Check if the i-th bit is set or not.java:2
↓ 1 callersMethodcheckSorted
(int[] arr)
Arrays/Easy/Check If an Array is Sorted.java:17
↓ 1 callersMethodcheckValidString
(String s)
Greedy/Easy Problems/Valid Paranthesis Checker.java:30
↓ 1 callersMethodclimbStairs
(int n)
Dynamic Programming/1D DP/Climbing Stars.java:79
↓ 1 callersMethodcoinChange
(int[] coins, int amount)
Dynamic Programming/DP on Subsequences/Minimum Coins (DP – 20).java:112
↓ 1 callersMethodcombinationSum
(int[] arr, int target)
Recursion/Subsequences Pattern/Combination Sum.java:49
↓ 1 callersMethodcombinationSum
(int[] arr, int target)
Recursion/Subsequences Pattern/Count all subsequences with sum K.java:32
↓ 1 callersMethodcombinationSum
(int[] arr, int target)
Recursion/Subsequences Pattern/check if there exists a subsequence and if exist print just one subsequence.java:36
↓ 1 callersMethodcombinationSum
(int[] arr, int target)
Recursion/Subsequences Pattern/Print all subsequences with sum K.java:30
↓ 1 callersMethodcombinationSum
(int[] arr, int target)
Recursion/Subsequences Pattern/Combination Sum-II.java:76
↓ 1 callersMethodcombinationSum3
(int k, int n)
Recursion/Subsequences Pattern/Combination Sum – III.java:56
↓ 1 callersMethodcountDistinctIslands
(int[][] grid)
Graph/Problems on BFS & DFS/Number of Distinct Islands.java:68
↓ 1 callersMethodcountGoodNumbers
(long n)
Recursion/Easy Problems/Count Good Numbers.java:27
↓ 1 callersMethodcountNodes
(Node slow)
LinkedList/Medium/Length of Loop in LinkedList.java:14
↓ 1 callersMethodcountNodes
(Node root)
Binary Trees/Hard Problems/Count total Nodes in a COMPLETE Binary Tree.java:62
↓ 1 callersMethodcountOccurence
(int[] arr, int target)
Binary Search/1D Array/Count occurrences of a number in a sorted array with duplicates.java:45
↓ 1 callersMethodcountPartitions
(int n, int d, int arr[])
Dynamic Programming/DP on Subsequences/Count Partitions with Given Difference (DP – 18).java:126
↓ 1 callersMethodcountPaths
(int n, int[][] roads)
Graph/Shortest Path Algorithms and Problems/Number of ways to arrive at destination.java:50
↓ 1 callersMethodcountPrimes
(int n)
Bit Manipulation/Advanced Maths/Count Prime Using Sieve of Eratosthenes.java:33
↓ 1 callersMethodcountSetBits
(int n)
Bit Manipulation/Easy Problems/Count the number of set bits.java:2
↓ 1 callersMethodcountSmallerThanMiddle
(int[] nums, int middle)
Binary Search/2D Arrays/Median in a row-wise sorted Matrix.java:23
↓ 1 callersMethodcountSquares
(int[][] matrix)
Dynamic Programming/DP on Squares/Count Square Submatrices with All 1s (DP-56).java:38
↓ 1 callersMethodcountSub
(long arr[])
Heap/Easy Problems/Check if an array represents a min-heap or not.java:20
↓ 1 callersMethodcountWays
(int n, String s)
Dynamic Programming/MCM DP - Partition DP/Evaluate Boolean Expression to True (DP-52).java:216
↓ 1 callersMethodcreateSieve
()
Bit Manipulation/Advanced Maths/Count Prime Using Sieve of Eratosthenes.java:19
↓ 1 callersMethodcriticalConnections
(int n, List<List<Integer>> connections)
Graph/Other Algorithms/Bridges in Graph.java:54
↓ 1 callersMethodcutRod
(int price[], int n)
Dynamic Programming/DP on Subsequences/Rod Cutting Problem (DP – 24).java:140
↓ 1 callersMethoddelete
(int index)
LinkedList/Implementation of LinkedList.java:113
↓ 1 callersMethoddelete
(int value)
LinkedList/Implementation Of Circular LinkedList.java:35
↓ 1 callersMethoddeleteFirst
()
LinkedList/Implementation of LinkedList.java:83
↓ 1 callersMethoddeleteNode
(Node root, int key)
Binary Search Trees/Practice Problems/Delete a Node in Binary Search Tree.java:42
↓ 1 callersMethoddeserialize
(String data)
Binary Trees/Hard Problems/Serialize and deserialize Binary Tree.java:71
↓ 1 callersMethoddetectCycle
(int src, int n, ArrayList<ArrayList<Integer>> adj, boolean[] vis)
Graph/Problems on BFS & DFS/Cycle Detection in unirected Graph (bfs).java:49
↓ 1 callersMethoddfs
(int node, int parent, int[]vis, ArrayList<ArrayList<Integer>> adj, int[] tin, int[] low, int[] mark)
Graph/Other Algorithms/Articulation Point.java:30
↓ 1 callersMethoddfs
(int node, int parent, int[]vis, ArrayList<ArrayList<Integer>> adj, int[] tin, int[] low, List<List<Integer>>
Graph/Other Algorithms/Bridges in Graph.java:35
↓ 1 callersMethoddfs
(int node, ArrayList<ArrayList<Integer>> adj)
Graph/Learning/Depth First Search (DFS).java:55
↓ 1 callersMethoddfs
(int node, ArrayList<ArrayList<Integer>> adj, int[] vis, Stack<Integer> st)
Graph/Topo Sort and Problems/Topological Sort Algorithm.java:56
↓ 1 callersMethoddfs
(int node, List<List<Integer>> adj, int[] vis, int[] pathVis, int[] check)
Graph/Topo Sort and Problems/Find eventual safe states.java:98
↓ 1 callersMethoddfs
(int[][] grid, int row, int col, int time, int[][] vis)
Graph/MinimumSpanningTree & Disjoint Set and Problems/Swim in rising water.java:27
↓ 1 callersMethoddfs
(int row, int col, int n, int m, int[][] vis, int[][] grid, int[] delRow, int[] delCol, ArrayList<
Graph/Problems on BFS & DFS/Number of Distinct Islands.java:54
↓ 1 callersMethoddfs
(int ro, int co, char[][] grid, int[][] vis)
Graph/Problems on BFS & DFS/Find the number of islands.java:64
↓ 1 callersMethoddfs
(int row, int col, int[][] ans, int[][] image, int newColor, int[] delRow, int[] delCol, int iniColor)
Graph/Problems on BFS & DFS/Flood fill.java:40
↓ 1 callersMethoddfs
(int src, int parent, int n, ArrayList<ArrayList<Integer>> adj, boolean[] vis)
Graph/Problems on BFS & DFS/Cycle Detection in undirected Graph (dfs).java:43
↓ 1 callersMethoddfs
(int node, ArrayList<ArrayList<Integer>> adj, int[] vis, int[] pathVis)
Graph/Problems on BFS & DFS/Cycle Detection in Directed Graph (DFS).java:44
↓ 1 callersMethoddfs
(int node, ArrayList<ArrayList<Integer>> adj, boolean[] vis)
Graph/Problems on BFS & DFS/Number of provinces.java:50
↓ 1 callersMethoddfsOfGraph
(int n, ArrayList<ArrayList<Integer>> adj)
Graph/Learning/Depth First Search (DFS).java:64
↓ 1 callersMethoddiameterOfBinaryTree
(Node root)
Binary Trees/Medium Problems/Diameter of Binary Tree.java:37
↓ 1 callersMethoddisplay
()
LinkedList/Implementation Of Circular LinkedList.java:23
↓ 1 callersMethoddistanceK
(Node root, Node target, int k)
Binary Trees/Hard Problems/Print all the Nodes at a distance of K in a Binary Tree.java:64
↓ 1 callersMethoddivide
(int dividend, int divisor)
Bit Manipulation/Easy Problems/Divide two integers without using multiplication, division and mod operator.java:25
↓ 1 callersMethoderaseOverlapIntervals
(int[][] intervals)
Greedy/Medium or Hard Problems/Non-overlapping Intervals.java:26
↓ 1 callersMethodevenlyDivides
(int N)
Basic Maths Programs/Count Digits.java:14
↓ 1 callersMethodeventualSafeNodes
(int n, List<List<Integer>> adj)
Graph/Topo Sort and Problems/Find eventual safe states.java:111
↓ 1 callersMethodexist
(char[][] board, String word)
Recursion/Hard Problems/Word Search.java:44
↓ 1 callersMethodfib
(int n)
Basic Recursion/Fibonacci Series.java:26
↓ 1 callersMethodfind
(int value)
LinkedList/Implementation Of Doubly LinkedList.java:42
↓ 1 callersMethodfindAllPrimeFactors
(int n)
Bit Manipulation/Advanced Maths/Print Prime Factors of a Number.java:39
↓ 1 callersMethodfindAnagrams
(String s, String p)
Sliding Window/Medium Problems/Find All Anagrams in a String.java:53
↓ 1 callersMethodfindBeauty2
(int[] cnt)
Strings/medium/Sum of Beauty of all substring.java:25
↓ 1 callersMethodfindCeil
(Node root, int key)
Binary Search Trees/Practice Problems/Ceil in a Binary Search Tree.java:46
↓ 1 callersMethodfindCeil
(int[] nums, int target)
Binary Search/1D Array/Implement Upper Bound.java:13
↓ 1 callersMethodfindCheapestPrice
(int n, int[][] flights, int src, int dst, int k)
Graph/Shortest Path Algorithms and Problems/Cheapest flights within k stops.java:60
↓ 1 callersMethodfindCombination
(int idx, int[] arr, int target, List<List<Integer>> ans, ArrayList<Integer> ds, int k)
Recursion/Subsequences Pattern/Combination Sum – III.java:36
↓ 1 callersMethodfindCombination
(int idx, int[] arr, int target, List<List<Integer>> ans, ArrayList<Integer> ds)
Recursion/Subsequences Pattern/Combination Sum.java:32
↓ 1 callersMethodfindCombination
(int idx, int[] arr, int target)
Recursion/Subsequences Pattern/Count all subsequences with sum K.java:13
↓ 1 callersMethodfindCombination
(int idx, int[] arr, int target, List<List<Integer>> ans, ArrayList<Integer> ds)
Recursion/Subsequences Pattern/check if there exists a subsequence and if exist print just one subsequence.java:16
↓ 1 callersMethodfindCombination
(int idx, int[] arr, int target, List<List<Integer>> ans, ArrayList<Integer> ds)
Recursion/Subsequences Pattern/Print all subsequences with sum K.java:15
↓ 1 callersMethodfindCombination
(int idx, String digits, List<String> ans, StringBuilder sb, HashMap<Character, String> map)
Recursion/Subsequences Pattern/Letter Combinations of a Phone number.java:27
↓ 1 callersMethodfindCombination
(int idx, int[] arr, int target, List<List<Integer>> ans, ArrayList<Integer> ds)
Recursion/Subsequences Pattern/Combination Sum-II.java:60
↓ 1 callersMethodfindContentChildren
(int[] g, int[] s)
Greedy/Easy Problems/Assign Cookies.java:30
↓ 1 callersMethodfindFloor
(int[] nums, int target)
Binary Search/1D Array/Implement Lower Bound.java:21
↓ 1 callersMethodfindHcf
(Long a, Long b, Long[] ans)
Basic Maths Programs/LCM & HCF.java:25
↓ 1 callersMethodfindIntersection
(int[] arr1, int[] arr2, int n, int m)
Arrays/Easy/Intersection of Two Sorted Array.java:28
↓ 1 callersMethodfindKRotation
(int arr[], int n)
Binary Search/1D Array/Find out how many times has an array been rotated.java:18
↓ 1 callersMethodfindKthLargest
(int[] nums, int k)
Heap/Medium Problems/Kth largest element in an array [use priority queue].java:25
↓ 1 callersMethodfindKthPositive
(int[] arr, int k)
Binary Search/Search Space/Kth Missing Positive Number.java:26
↓ 1 callersMethodfindLastRight
(Node root)
Binary Search Trees/Practice Problems/Delete a Node in Binary Search Tree.java:82
↓ 1 callersMethodfindLcm
(Long a, Long b, Long[] ans)
Basic Maths Programs/LCM & HCF.java:33
↓ 1 callersMethodfindLeftHeight
(Node root)
Binary Trees/Hard Problems/Count total Nodes in a COMPLETE Binary Tree.java:69
↓ 1 callersMethodfindMaxConsecutiveOnes
(int[] nums)
Arrays/Easy/Find Maximum Consecutive 1's.java:15
← previousnext →101–200 of 1,060, ranked by callers