MCPcopy Create free account

hub / github.com/MAZHARMIK/Interview_DS_Algo / functions

Functions3,557 in github.com/MAZHARMIK/Interview_DS_Algo

↓ 1 callersFunctionnumOnes
Arrays/Binary Search/The K Weakest Rows in a Matrix.cpp:192
↓ 1 callersFunctionnumberOfWays
DP/Coin Change II.cpp:110
↓ 1 callersFunctionpermuteUnique
Backtracking/Permutations II.cpp:109
↓ 1 callersFunctionprintPrimes
Mathematical/Segmented Sieve.cpp:29
↓ 1 callersFunctionremoveNodes
Linked List/Remove Nodes From Linked List.cpp:165
↓ 1 callersMethodreverse
Arrays/2-D Array/Leetcode Easy/Matrix Similarity After Cyclic Shifts.cpp:128
↓ 1 callersMethodreverse
HashMap/Count Nice Pairs in an Array.cpp:24
↓ 1 callersMethodrotate
Arrays/2-D Array/Rotate Image.cpp:16
↓ 1 callersMethodshortestDistanceColor
Arrays/Binary Search/Shortest Distance to Target Color.cpp:62
↓ 1 callersFunctionsolve
DP/Coin Change II.cpp:16
↓ 1 callersFunctionsolve
Backtracking/Tug_Of_War.cpp:31
↓ 1 callersMethodswap
Recursion/Quick Sort.cpp:78
↓ 1 callersFunctiontowDKadane
DP/Maximum Sum Rectangular Submatrix in Matrix dynamic programming(2-D kadane).cpp:48
↓ 1 callersMethodunion
Graph/Redundant Connection.cpp:290
↓ 1 callersMethodunion
Graph/BFS_DFS/Power Grid Maintenance.cpp:415
↓ 1 callersMethodunion
Graph/Disjoint Set/Maximum Number of Fish in a Grid.cpp:233
↓ 1 callersMethodunion
Graph/Disjoint Set/Count the Number of Complete Components.cpp:308
MethodAllOne
Design/All O`one Data Structure.cpp:57
MethodAllPossibleStrings
Recursion/Power Set.cpp:35
MethodBFS
BFS************************/
Graph/The Maze.cpp:76
MethodBFS
Graph/Maximum Employees to Be Invited to a Meeting.cpp:16
MethodBFS
Graph/Clone Graph.cpp:106
MethodBFS
Graph/The Maze II.cpp:105
MethodBFS
Graph/BFS_DFS/Similar String Groups.cpp:81
MethodBFS
Graph/BFS_DFS/Detonate the Maximum Bombs.cpp:74
MethodBFS
Graph/BFS_DFS/Find Minimum Diameter After Merging Two Trees.cpp:20
MethodBFS
DP/Game Strategy/Maximum Number of Moves to Kill All Pawns.cpp:17
MethodBFS
Tree/Time Needed to Inform All Employees.cpp:47
MethodBank
Design/Simple Bank System.cpp:18
MethodBinarySearch
Arrays/Binary Search/Successful Pairs of Spells and Potions.cpp:55
MethodBrowserHistory
Design/Design Browser History.cpp:13
MethodCell
Graph/Dijkstra'a Based Problems/Find Minimum Time to Reach Last Room II.cpp:76
MethodCheck
Arrays/Binary Search/Minimum Number of Seconds to Make Mountain Height Zero.cpp:18
MethodCount
Recursion/K-th Smallest in Lexicographical Order.cpp:94
MethodCustomStack
Design/Design a Stack With Increment Operation.cpp:19
MethodDFS
Graph/Sum of Distances in Tree.cpp:32
MethodDFS
Graph/All Paths From Source to Target.cpp:11
MethodDFS
DFS************************/
Graph/The Maze.cpp:44
MethodDFS
Graph/Longest Path With Different Adjacent Characters.cpp:16
MethodDFS
Graph/Minimum Time to Collect All Apples in a Tree.cpp:11
MethodDFS
Graph/Clone Graph.cpp:11
MethodDFS
Graph/The Maze II.cpp:47
MethodDFS
Graph/Number of Nodes in the Sub-Tree With the Same Label.cpp:11
MethodDFS
Graph/Reconstruct Itinerary.cpp:36
MethodDFS
Graph/All Ancestors of a Node in a Directed Acyclic Graph.cpp:16
MethodDFS
Graph/Word Ladder II.cpp:40
MethodDFS
Graph/BFS_DFS/Similar String Groups.cpp:24
MethodDFS
Graph/BFS_DFS/Lexicographically Smallest Equivalent String.cpp:18
MethodDFS
Graph/BFS_DFS/Detonate the Maximum Bombs.cpp:11
MethodDFS
Graph/BFS_DFS/Making A Large Island.cpp:18
MethodDFS
Graph/Euler/Euler circuit and Path.cpp:12
MethodDFS
Graph/Topological Sorting/Course Schedule II.cpp:78
MethodDFS
Graph/Topological Sorting/Topological Sort (DFS).cpp:12
MethodDFS
DP/Minimum Path Sum.cpp:41
MethodDFS
DP/Maximum Profit from Trading Stocks with Discounts.cpp:16
MethodDFS
Trie/Word Search II.cpp:42
MethodDFS
Arrays/2-D Array/DFS/Minimum Number of Days to Disconnect Island.cpp:18
MethodDFS
Arrays/2-D Array/DFS/Pacific Atlantic Water Flow.cpp:24
MethodDFS
Tree/Maximum Width of Binary Tree.cpp:46
MethodDFS
Tree/Maximum Level Sum of a Binary Tree.cpp:58
MethodDFS
Tree/Find Largest Value in Each Tree Row.cpp:56
MethodDFS
Tree/Time Needed to Inform All Employees.cpp:14
MethodDFS
Tree/Find Duplicate Subtrees.cpp:11
MethodDFS
Backtracking/Path with Maximum Gold.cpp:17
MethodDFSAlice
Graph/BFS_DFS/Most Profitable Path in a Tree.cpp:39
MethodDFSBob
Graph/BFS_DFS/Most Profitable Path in a Tree.cpp:19
FunctionDSU
Graph/BFS_DFS/Making A Large Island.cpp:484
MethodDSU
Graph/Redundant Connection.cpp:118
MethodDSU
Graph/BFS_DFS/Making A Large Island.cpp:202
MethodDSU
Graph/Disjoint Set/Disjoint set (Union-Find-Size).cpp:12
MethodDSU
Graph/Disjoint Set/Maximum Number of Fish in a Grid.cpp:18
MethodDSU
Graph/Disjoint Set/Greatest Common Divisor Traversal.cpp:18
MethodDSU
Graph/Disjoint Set/Remove Max Number of Edges to Keep Graph Fully Traversable.cpp:22
MethodDSU
Graph/Disjoint Set/Maximize Spanning Tree Stability with Upgrades.cpp:17
MethodDSU
Graph/Disjoint Set/Count the Number of Complete Components.cpp:125
MethodDSU
Graph/Disjoint Set/Count the Number of Complete Components.cpp:294
MethodDijkstraAlgo
Graph/Dijkstra'a Based Problems/Modify Graph Edge Weights.cpp:20
MethodFancy
Mathematical/Fancy Sequence.cpp:39
MethodFind
Graph/BFS_DFS/Power Grid Maintenance.cpp:170
MethodFindElements
Tree/Find Elements in a Contaminated Binary Tree.cpp:25
MethodFindLength
Linked List/Swapping Nodes in a Linked List.cpp:11
MethodFindSumPairs
Design/Finding Pairs With a Certain Sum.cpp:18
MethodFirstNonRepeating
Linked List/Double Linked List/First non-repeating character in a stream .cpp:10
MethodFloydWarshall
Graph/Floyd Warshall/Minimum Cost to Convert String I.cpp:14
MethodFoodRatings
Design/Design a Food Rating System.cpp:21
MethodGraph
Graph/Dijkstra'a Based Problems/Design Graph With Shortest Path Calculator.cpp:18
MethodGraph
Graph/Floyd Warshall/Design Graph With Shortest Path Calculator.cpp:14
MethodIsAnyAncestorLocked
Condition-3 (Check if any ancestor is locked)
Design/Operations on Tree.cpp:56
FunctionIsFoldable
Function to check whether a binary tree is foldable or not.
Tree/Foldable Binary Tree.cpp:25
MethodIsFoldable
Function to check whether a binary tree is foldable or not.
Tree/Foldable Binary Tree.cpp:40
MethodIsPossible
Arrays/Binary Search/Apply Operations to Maximize Frequency Score.cpp:12
MethodItem
DP/Knapsack Series/Fractional Knapsack.cpp:55
MethodJob
DP/Maximum Profit in Job Scheduling.cpp:297
MethodKMP_codestorywithMIK
strings/Find Beautiful Indices in the Given Array I.cpp:35
MethodKMP_codestorywithMIK
strings/Find Beautiful Indices in the Given Array II.cpp:37
MethodKruskal
Graph/Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree.cpp:189
MethodKruskal
Graph/Minimum Spanning Tree (Kruskal's Algorithm).cpp:38
MethodKruskal
Graph/Min Cost to Connect All Points.cpp:160
MethodKthLargest
Heap/Kth Largest Element in a Stream.cpp:18
MethodLCA
Tree/Lowest Common Ancestor of Deepest Leaves.cpp:19
← previousnext →401–500 of 3,557, ranked by callers