Ultimate DSA problems
Your one stop solution for DSA revision
We have hand picked the best problems from the most popular coding platforms and curated them into a single platform for you to practice and revise.
| Problem | Code | |||
|---|---|---|---|---|
| Recursion | ||||
Fibonacci | ||||
Tribonacci | ||||
Climbing Stairs | ||||
Min Cost Climbing Stairs | ||||
House Robber | ||||
House Robber 2 | ||||
Subsets | ||||
Combinations | ||||
Generate Parentheses | ||||
Decode Ways | ||||
Permutations | ||||
N-Queens | ||||
Sudoku Solver | ||||
| Dynamic Programming | ||||
Fibonacci | ||||
LCS | ||||
Edit Distance | ||||
Wildcard Matching | ||||
Partition Equal Subset Sum | ||||
Coin Change | ||||
Regular Expression Matching | ||||
Palindromic Substrings | ||||
Longest Palindromic Substring | ||||
Longest Palindromic Subsequence | ||||
Palindrome Partitioning | ||||
Palindrome Partitioning 2 | ||||
Word Break | ||||
Buy and Sell Stock K Transactions | ||||
Kanpsack | ||||
LIS | ||||
Kadane's Max Subarray | ||||
Unique Paths | ||||
Square Submatrices | ||||
Matrix Chain Multiplication | ||||
| Binary tree | ||||
Path Sum 2 | ||||
Root to Leaf Nos Sum | ||||
Pre Order | ||||
Post Order | ||||
In Order | ||||
Level Order Traversal | ||||
Level Order Traversal 2 | ||||
ZigZag Level Order Traversal | ||||
Right View of Binary Tree | ||||
Vertical Order Traversal | ||||
BT From Pre and Inorder | ||||
BT From Post and Inorder | ||||
LCA of BT | ||||
Serialise Deserialise | ||||
| BST | ||||
Insert in Bst | ||||
Validate BST | ||||
Construct BST From Preorder | ||||
Delete Node in Bst | ||||
LCA of BST | ||||
Unique BSTs | ||||
Unique BSTs 2 | ||||
| N-Ary Trees | ||||
Level Order Traversal | ||||
| Graphs | ||||
Find Path | ||||
No of Provinces | ||||
No of Islands | ||||
Numbers With Same Consecutive Differences | ||||
Clone Graph | ||||
Bipartite | ||||
Matrix 01 | ||||
Word Ladder | ||||
Course Schedule | ||||
Course Schedule 2 | ||||
Dijkstra Algo | ||||
Network Delay Time | ||||
Cheapest Flights With K-Stops | ||||
Min Cost to Connect Points | ||||
