MCPcopy Create free account

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

Functions668 in github.com/Codensity30/Strivers-A2Z-DSA-Sheet

⨍ Functions 668◇ Types & classes 33
↓ 140 callersMethodpush
07.Stack and Queues/1. Learning/01. Implement stack using array.cpp:27
↓ 107 callersMethodtop
07.Stack and Queues/1. Learning/07. Implement min stack.cpp:63
↓ 98 callersMethodpop
07.Stack and Queues/1. Learning/01. Implement stack using array.cpp:33
↓ 9 callersMethoderase
15. Tries/2. Problems/01. Implement Trie 2.cpp:76
↓ 5 callersMethodinsert
15. Tries/2. Problems/02. Complete String.cpp:49
↓ 4 callersFunctiondfs
13. Graphs/2. Traversal Problems/06. Surrounded Regions.cpp:19
↓ 4 callersFunctiondfs
13. Graphs/2. Traversal Problems/07. Number of Enclaves.cpp:21
↓ 4 callersMethodfindUPar
13. Graphs/5. MST Problems/07. Making Large Island.cpp:36
↓ 4 callersMethodinsert
Function to insert 'val' in the heap.
09. Heaps/1. Learning/01. Implement min heap.cpp:56
↓ 4 callersFunctionknows
07.Stack and Queues/4. Implementation/03. Celebrity Problem.cpp:26
↓ 3 callersMethodfindUPar
13. Graphs/5. MST Problems/05. Account Merge.cpp:32
↓ 3 callersFunctionheapify
09. Heaps/1. Learning/03. Convert min heap to max heap.cpp:24
↓ 2 callersFunctionbefore
12. Binary Search Trees/2. Practice Problems/10. Two Sum in BST.cpp:47
↓ 2 callersFunctioncalculateXOR
06.Bit Manipulation/2. Interview Problems/03. XOR of numbers from L to R.cpp:31
↓ 2 callersFunctionexpandFromCenter
03.Strings/2.Medium/06.Longest_palindromic_substring.cpp:24
↓ 2 callersMethodfindUPar
13. Graphs/5. MST Problems/06. Number of islands 2.cpp:61
↓ 2 callersMethodfindUPar
13. Graphs/5. MST Problems/04. Most stones removed.cpp:53
↓ 2 callersMethodfindUPar
13. Graphs/5. MST Problems/03. Number of Operations to make Network.cpp:35
↓ 2 callersMethodfindUParent
13. Graphs/5. MST Problems/02. Kruskal's Algorithm.cpp:46
↓ 2 callersFunctionfmemo
Memoization
14. Dynamic Programming/2. 1D DP/05. House Robber 2.cpp:32
↓ 2 callersFunctionisLand
13. Graphs/5. MST Problems/07. Making Large Island.cpp:55
↓ 2 callersFunctionkDistinctIntegers
08. Sliding Window/2. Hard Problems/02. Count the number of substrings with exactly K unique characters.cpp:35
↓ 2 callersFunctionleafTraversal
11. Binary Trees/2. Medium Problems/07. Boundary Traversal.cpp:36
↓ 2 callersFunctionnext
12. Binary Search Trees/2. Practice Problems/10. Two Sum in BST.cpp:37
↓ 2 callersFunctionpushLeft
12. Binary Search Trees/2. Practice Problems/10. Two Sum in BST.cpp:23
↓ 2 callersFunctionpushLeft
12. Binary Search Trees/2. Practice Problems/09. BST Iterator.cpp:33
↓ 2 callersFunctionpushLeft
11. Binary Trees/1. Traversals/09. Iterative Postorder.cpp:20
↓ 2 callersFunctionpushLeft
11. Binary Trees/1. Traversals/08. Iterative Inorder Traversal.cpp:18
↓ 2 callersFunctionpushRight
12. Binary Search Trees/2. Practice Problems/10. Two Sum in BST.cpp:30
↓ 2 callersFunctionreverseLL
04.Linked List/3.Medium Problems of LL/12.Add_1_to_LL.cpp:20
↓ 2 callersFunctionsubstrAtmostK
03.Strings/2.Medium/05.Count_the_number_of_substrings_with_k_unique_characters.cpp:36
↓ 1 callersFunctionallStars
14. Dynamic Programming/5. DP on Strings/09. Wildcard Matching.cpp:26
↓ 1 callersMethodcountComponents
13. Graphs/5. MST Problems/04. Most stones removed.cpp:73
↓ 1 callersFunctioncountNode
04.Linked List/3.Medium Problems of LL/05.Count_nodes_in_loop.cpp:41
↓ 1 callersFunctioncountOfUnvalidSubstrings
08. Sliding Window/1. Medium Problems/07. Number of Substrings Containing all 3 characters.cpp:26
↓ 1 callersFunctiondfs
13. Graphs/2. Traversal Problems/11. Bipartite Graph.cpp:23
↓ 1 callersFunctiondfs
13. Graphs/2. Traversal Problems/12. Detect Cycle in Directed Graph.cpp:17
↓ 1 callersFunctiondfs
13. Graphs/2. Traversal Problems/01. Count the number of provinces.cpp:22
↓ 1 callersFunctiondfs
13. Graphs/2. Traversal Problems/04. Detect Cycle in Undirected Graph.cpp:15
↓ 1 callersFunctiondfs
13. Graphs/2. Traversal Problems/10. Distinct Islands.cpp:17
↓ 1 callersFunctiondfs
13. Graphs/4. Shortest Path Problems/02. Shortest path in DAG.cpp:20
↓ 1 callersFunctiondfs
13. Graphs/6. Other Algorithms/01. Bridges in graph.cpp:24
↓ 1 callersFunctiondfs
13. Graphs/6. Other Algorithms/02. Strongly Connected Components.cpp:29
↓ 1 callersFunctiondfs
13. Graphs/1. Learning/04. DFS.cpp:22
↓ 1 callersFunctiondfs
13. Graphs/3. Topo Sort Problems/01. Topological Sorting.cpp:15
↓ 1 callersMethoddisconnected
13. Graphs/5. MST Problems/03. Number of Operations to make Network.cpp:53
↓ 1 callersFunctionfibo
Memoization
14. Dynamic Programming/1. Intro to DP/01. Find the nth fibonacci number.cpp:21
↓ 1 callersMethodfindMax
15. Tries/2. Problems/05. Maximum XOR of two numbers.cpp:56
↓ 1 callersFunctionfindPath
11. Binary Trees/3. Hard/01. All root to leaf paths.cpp:18
↓ 1 callersFunctionfind_len
04.Linked List/5.Hard Promblems of LL/02.Rotate_LL_k_times.cpp:18
↓ 1 callersFunctionfmemo
Memoization
14. Dynamic Programming/2. 1D DP/04. House Robber.cpp:29
↓ 1 callersFunctionfmemo
Memoization
14. Dynamic Programming/2. 1D DP/03. Frog K Jumps.cpp:35
↓ 1 callersFunctionfmemo
14. Dynamic Programming/8. DP on Partition/03. Burst Ballons.cpp:32
↓ 1 callersFunctionfmemo
14. Dynamic Programming/8. DP on Partition/05. Palindorme Partionting 2.cpp:35
↓ 1 callersFunctionfmemo
14. Dynamic Programming/8. DP on Partition/02. Minimum cost to cut stick.cpp:31
↓ 1 callersFunctionfmemo
14. Dynamic Programming/8. DP on Partition/06. Partition array for maximum sum.cpp:29
↓ 1 callersFunctionfmemo
14. Dynamic Programming/8. DP on Partition/01. MCM.cpp:33
↓ 1 callersFunctionfmemo
Memoization
14. Dynamic Programming/3. 2D DP/05. Minimum Path in Triangle.cpp:32
↓ 1 callersFunctionfmemo
Memoization
14. Dynamic Programming/3. 2D DP/06. Minimum Falling Path Sum.cpp:28
↓ 1 callersFunctionfmemo
Memeoization
14. Dynamic Programming/3. 2D DP/02. Unique Paths.cpp:28
↓ 1 callersFunctionfmemo
Memoization
14. Dynamic Programming/3. 2D DP/04. Minimum Path Sum.cpp:28
↓ 1 callersFunctionfmemo
Memoization
14. Dynamic Programming/3. 2D DP/03. Unique Paths 2.cpp:35
↓ 1 callersFunctionfmemo
Memoization
14. Dynamic Programming/3. 2D DP/01. Ninja Training.cpp:34
↓ 1 callersFunctionfmemo
14. Dynamic Programming/6. DP on Stocks/06. Buy and sell stocks with transaction fee.cpp:38
↓ 1 callersFunctionfmemo
14. Dynamic Programming/6. DP on Stocks/03. Best time to buy and sell stock upto 2 transaction.cpp:31
↓ 1 callersFunctionfmemo
14. Dynamic Programming/6. DP on Stocks/05. Buy and sell stocks with cooldown.cpp:31
↓ 1 callersFunctionfmemo
14. Dynamic Programming/6. DP on Stocks/04. Best time to buy and sell stock uoto k transaction.cpp:31
↓ 1 callersFunctionfmemo
14. Dynamic Programming/6. DP on Stocks/02. Best time to buy and sell stock 2.cpp:33
↓ 1 callersFunctionfmemo
Memoization
14. Dynamic Programming/4. DP on Subsequences/08. Target Sum.cpp:37
↓ 1 callersFunctionfmemo
Memoization
14. Dynamic Programming/4. DP on Subsequences/04. Count number of subsets with sum K.cpp:37
↓ 1 callersFunctionfmemo
QUESTION: Given an integer array `nums`, return `true` if you can partition the array into two subsets such that the sum of the elements in both subs
14. Dynamic Programming/4. DP on Subsequences/02. Partition array in two equal sum subsets.cpp:27
↓ 1 callersFunctionfmemo
Memoization
14. Dynamic Programming/4. DP on Subsequences/07. Coin Change.cpp:35
↓ 1 callersFunctionfmemo
Memoization
14. Dynamic Programming/4. DP on Subsequences/09. Coin Change 2.cpp:38
↓ 1 callersFunctionfmemo
Memoization
14. Dynamic Programming/4. DP on Subsequences/10. Unbounded Knapsack.cpp:40
↓ 1 callersFunctionfmemo
Memeoization
14. Dynamic Programming/4. DP on Subsequences/11. Rod Cutting Problem.cpp:33
↓ 1 callersFunctionfmemo
Memoization
14. Dynamic Programming/4. DP on Subsequences/01. Subset sum equal to k.cpp:31
↓ 1 callersFunctionfmemo
Memoization
14. Dynamic Programming/4. DP on Subsequences/05. Partition with given difference.cpp:46
↓ 1 callersFunctionfmemo
Memoization
14. Dynamic Programming/4. DP on Subsequences/06. 01 Knapsack.cpp:40
↓ 1 callersFunctionfmemo
14. Dynamic Programming/5. DP on Strings/03. Longest Common Substring.cpp:32
↓ 1 callersFunctionfmemo
14. Dynamic Programming/5. DP on Strings/06. Minimum steps to make other string.cpp:21
↓ 1 callersFunctionfmemo
14. Dynamic Programming/5. DP on Strings/08. Distinct Subsequences.cpp:21
↓ 1 callersFunctionfmemo
14. Dynamic Programming/5. DP on Strings/09. Wildcard Matching.cpp:33
↓ 1 callersFunctionfmemo
Memoization
14. Dynamic Programming/5. DP on Strings/04. Longest Palindromic Subsequence.cpp:27
↓ 1 callersFunctionfmemo
Memoization
14. Dynamic Programming/5. DP on Strings/01. Longest Common Subsequence.cpp:38
↓ 1 callersFunctionfmemo
14. Dynamic Programming/5. DP on Strings/05. Minimum steps to make string palindrome.cpp:22
↓ 1 callersFunctionfopt
Space Optimization
14. Dynamic Programming/2. 1D DP/01. Climbing Stairs.cpp:40
↓ 1 callersFunctionfopt
Space Optimized
14. Dynamic Programming/2. 1D DP/02. Frog Jump.cpp:51
↓ 1 callersFunctionfromLeft
14. Dynamic Programming/7. DP on LIS/04. Longest Bitonic Subsequence.cpp:24
↓ 1 callersFunctionfromRight
14. Dynamic Programming/7. DP on LIS/04. Longest Bitonic Subsequence.cpp:36
↓ 1 callersFunctionftab
14. Dynamic Programming/4. DP on Subsequences/03. Minimum Sum Partition.cpp:31
↓ 1 callersFunctionftab
14. Dynamic Programming/7. DP on LIS/02. Print LIS.cpp:23
↓ 1 callersFunctionftab
14. Dynamic Programming/7. DP on LIS/01. Longest Increasing Subsequence.cpp:22
↓ 1 callersFunctionftab
14. Dynamic Programming/7. DP on LIS/03. Largest Divisible Subset.cpp:27
↓ 1 callersFunctionftab
14. Dynamic Programming/7. DP on LIS/05. Number of LIS.cpp:23
↓ 1 callersFunctionftab
14. Dynamic Programming/9. DP on Squares/01. Maximal Square.cpp:27
↓ 1 callersFunctionftab
14. Dynamic Programming/9. DP on Squares/02. Count square submatrices.cpp:37
↓ 1 callersFunctionftab
14. Dynamic Programming/5. DP on Strings/02. Print the LCS.cpp:26
↓ 1 callersFunctionget_maxmin
Question: The beauty of a string is the difference in frequencies between the most frequent and least frequent characters. Given a string `s`, you n
03.Strings/2.Medium/07.Sum_of_beauty_of_all_substrings.cpp:30
↓ 1 callersFunctiongetnum
Your task is to implement the function atoi. The function takes a string (str) as an argument and converts it to an integer and returns it. Note: You
05.Recursion/1.Get Strong Hold/01.Implement_atoi_via_recursion.cpp:34
↓ 1 callersFunctioninorder
12. Binary Search Trees/2. Practice Problems/05. Kth smallest element in BST.cpp:39
next →1–100 of 668, ranked by callers