DSA Basics: Every Problem Pattern
The questions that cover every basic pattern, topic by topic and from easy to hard: the ones Akshay solves in the course. Each opens on LeetCode or GeeksforGeeks, Visualize opens its animated demo in the Visual Lab, and Mark as done keeps your progress (sign in to save it).
Arrays 8
Binary Search 10
Linked List 17
Hashing 12
Heap 11
Stack 17
Queue 5
Sliding Window 17
Two Pointers 8
Binary Tree 20
Graph Basics 1
| # | Question | Visual | Status |
|---|---|---|---|
| 1 | Basics of graphs | Visualize |
BFS 12
DFS 3
| # | Question | Visual | Status |
|---|---|---|---|
| 1 | DFS of Graph | ||
| 2 | Directed Graph Cycle | Visualize | |
| 3 | Undirected Graph Cycle | Visualize |
Topological Sort 3
| # | Question | Visual | Status |
|---|---|---|---|
| 1 | Topological sort | ||
| 2 | Course Schedule II | Visualize | |
| 3 | Alien Dictionary |
DAG 4
Union Find 6
| # | Question | Visual | Status |
|---|---|---|---|
| 1 | Disjoint Sets Visualization | ||
| 2 | Number of Connected Components in an Undirected Graph | ||
| 3 | Redundant Connection | ||
| 4 | Minimum Spanning Tree | ||
| Non graph union find | |||
| 5 | Lexicographically Smallest Equivalent String | ||
| 6 | Accounts Merge | ||
Dijkstra 11
Articulation Points 5
Dynamic Programming 10
Backtracking 11
| # | Question | Visual | Status |
|---|---|---|---|
| Medium | |||
| 1 | Subsets | ||
| 2 | Subsets II | ||
| 3 | Sudoku Solver | ||
| 4 | Permutations | ||
| 5 | Permutations II | ||
| 6 | Target Sum | ||
| 7 | Combination Sum II | ||
| 8 | Word Search | Visualize | |
| 9 | Rat in a Maze Problem - I | Visualize | |
| Hard | |||
| 10 | N-Queens | Visualize | |
| 11 | Numbers At Most N Given Digit Set | ||
Trie 7
| # | Question | Visual | Status |
|---|---|---|---|
| Strings | |||
| 1 | Implement Trie (Prefix Tree) | ||
| 2 | Design Add and Search Words Data Structure | ||
| 3 | Search Suggestions System | ||
| 4 | Count of distinct substrings | ||
| Binary | |||
| 5 | Unique rows in boolean matrix | ||
| 6 | Minimum XOR value pair | ||
| Array | |||
| 7 | Count Caesar Cipher Pairs | ||
Intervals 7
| # | Question | Visual | Status |
|---|---|---|---|
| Medium | |||
| 1 | Merge Intervals | ||
| 2 | Insert Interval | ||
| 3 | Interval List Intersections | ||
| 4 | My Calendar I | ||
| Hard | |||
| 5 | Range Module | ||
| 6 | Count Integers In Intervals | ||
| 7 | Course Schedule III | ||
Greedy 9
| # | Question | Visual | Status |
|---|---|---|---|
| Easy | |||
| 1 | N meetings in one room | Visualize | |
| 2 | Maximize Toys | ||
| Medium | |||
| 3 | Best Time to Buy and Sell Stock II | ||
| 4 | Non-overlapping Intervals Standard | Visualize | |
| 5 | Minimum Number of Arrows to Burst Balloons Standard | ||
| 6 | Minimum Platforms Must do | Visualize | |
| 7 | Bag of Tokens | ||
| 8 | Minimum Number of Operations to Make Array Empty | ||
| Hard | |||
| 9 | Job Sequencing Problem | Visualize | |
Math 1
| # | Question | Visual | Status |
|---|---|---|---|
| 1 | Factorials of large numbers |
Segment Tree 3
| # | Question | Visual | Status |
|---|---|---|---|
| 1 | Range Sum Query - Mutable | ||
| 2 | Count of Smaller Numbers After Self | ||
| 3 | Longest Increasing Subsequence II |
KMP 4
Bit Manipulation 18
| # | Question | Visual | Status |
|---|---|---|---|
| Basic manipulation | |||
| 1 | Number of 1 Bits | ||
| 2 | Add Binary | ||
| 3 | Reverse Bits | ||
| 4 | Counting Bits | ||
| 5 | Hamming Distance | ||
| 6 | Power of Four | ||
| Xor with self is 0 | |||
| 7 | Missing Number | ||
| 8 | Single Number | ||
| 9 | Set Mismatch | ||
| 10 | Single Number III | ||
| Medium | |||
| 11 | Smallest Subarrays With Maximum Bitwise OR | ||
| 12 | Longest Subarray With Maximum Bitwise AND | ||
| 13 | Maximum Product of Word Lengths | ||
| 14 | Bitwise XOR of All Pairings | ||
| 15 | Minimize XOR | ||
| 16 | Find Maximum Balanced XOR Subarray Length | ||
| Kth bit | |||
| 17 | Find Kth Bit in Nth Binary String | ||
| 18 | K-th Symbol in Grammar | ||