Recursion
Backtracking
Trees
Graphs
DP
Recursion backtracking
Subsets
[Link]
/
Subsets 2
[Link]
-ii/
Permutations
[Link]
ations/
Permutations 2
[Link]
ations-ii/
Combination sum
[Link]
ation-sum/
Combination sum 2
[Link]
ation-sum-ii/
Palindrome
partitioning
[Link]
ome-partitioning/
DYNAMIC
PROGRAMMING
Longest increasing
subsequence
Longest Increasing Subsequence
[Link]
-increasing-subsequence/
[Link]
divisible-subset/
[Link]
-doll-envelopes/
[Link]
m-length-of-pair-chain/
[Link]
-of-longest-increasing-subsequence/
[Link]
and-earn/
[Link]
Longest common
subsequence
Longest Common Subsequence
[Link]
-common-subsequence/
[Link]
ance/
[Link]
subsequences/
[Link]
m-ascii-delete-sum-for-two-strings/
Coin change
Coin Change:
[Link]
ange/
[Link]
ange-2/
[Link]
ation-sum-iv/
[Link]
squares/
[Link]
m-cost-for-tickets/
Matrix multiply
Matrix multiplication:
[Link]
m-score-triangulation-of-polygon/
[Link]
m-cost-tree-from-leaf-values/
[Link]
alloons/
Matrix 2d array
Matrix/2D Array:
[Link]
block-sum/
[Link]
um-query-2d-immutable/
[Link]
n-game/
[Link]
/
[Link]
l-square/
[Link]
m-falling-path-sum/
Hash DP
Hash + DP:
[Link]
um/
[Link]
-arithmetic-sequence/
[Link]
-arithmetic-subsequence-of-given-diffe
rence/
[Link]
m-product-of-splitted-binary-tree/
State machine
State machine:
[Link]
me-to-buy-and-sell-stock/
[Link]
me-to-buy-and-sell-stock-ii/
[Link]
me-to-buy-and-sell-stock-iii/
[Link]
me-to-buy-and-sell-stock-iv/
[Link]
me-to-buy-and-sell-stock-with-cooldow
n/
[Link]
me-to-buy-and-sell-stock-with-transact
ion-fee/
Real life
Leetcode articles
[Link]
iscussion/665604/Important-and-Usef
ul-links-from-all-over-the-Leetcode
[Link]
iscussion/458695/dynamic-programmi
ng-patterns
GRAPHS
A-Z
LEETCODE
ARTICLES
[Link]
iscussion/655708/Graph-For-Beginner
s-Problems-or-Pattern-or-Sample-Solu
tions
[Link]
de/2360573/Become-Master-In-Graph
UNION FIND
Union Find:
Identify if problems talks about finding
groups or components.
[Link]
ircles/
[Link]
ant-connection/
[Link]
ones-removed-with-same-row-or-colu
mn/
[Link]
-of-operations-to-make-network-conne
cted/
[Link]
DFS
Start DFS from nodes at boundary:
[Link]
ded-regions/
[Link]
-of-enclaves/
DFS PART 2
DFS from each unvisited node/Island
problems
[Link]
-of-closed-islands/
[Link]
-of-islands/
[Link]
d-rooms/
[Link]
ea-of-island/
[Link]
/
CYCLE FINDING
Breadth First Search
1. Shortest Path:
[Link]
01-matrix/
[Link]
as-far-from-land-as-possible/
[Link]
otting-oranges/
[Link]
hortest-path-in-binary-matrix/
GRAPH COLORING
Graph coloring/Bipartition
[Link]
e-bipartition/
[Link]
h-bipartite/
Problems asks to check if its possible
to divide the graph nodes into 2
groups
Apply BFS for same. Below is a
sample graph coloring approach.
TOPO SORTING
Topological Sort:
Check if its directed acyclic graph and
we have to arrange the elements in an
order in which we need to select the
most independent node at first.
Number of in-node 0
[Link]
schedule/
[Link]
schedule-ii/
TOPO SORTING
PART 2
DFS - Iterative and recursive
solutions
LEETCODE ARTICLES
[Link]
iscussion/655708/Graph-For-Beginner
s-Problems-or-Pattern-or-Sample-Solu
tions
[Link]
de/2360573/Become-Master-In-Graph
Trees - traversals
DFS iterative
Preorder traversal
DFS recursive
Other traversals
Leetcode articles
[Link]
-tree-traversal-in-pre-post-levelorder-views
[Link]
