Advanced DSA course
Learn Advanced DSA step by step: 148 lessons in 8 modules with worked examples, quizzes and interview questions. Free on JavaSchoolLab.
Trie
Graphs
- Graph Representation - Adjacency Matrix
- Graph Representation - Adjacency List
- Directed Graph
- Undirected Graph
- Weighted Graph
- BFS
- DFS
- Connected Components
- Cycle Detection
- Bipartite Graph
- Topological Sort
- Kahn's Algorithm
- DFS Topological Sort
- Shortest Path - BFS
- Shortest Path - Dijkstra
- Shortest Path - Bellman-Ford
- Shortest Path - Floyd-Warshall
- Minimum Spanning Tree - Prim's
- Minimum Spanning Tree - Kruskal's
- Disjoint Set Union - DSU
- Union-Find
- Strongly Connected Components - Kosaraju
- Strongly Connected Components - Tarjan
- Bridges
- Articulation Points
- Euler Path / Circuit
- Hamiltonian Path / Cycle
- Graph Coloring
- Network Flow
- Maximum Flow
- Bipartite Matching
Dynamic Programming
- Fibonacci (DP)
- Climbing Stairs
- House Robber
- Kadane (DP)
- Grid Paths
- Unique Paths
- Minimum Path Sum
- 0/1 Knapsack
- Unbounded Knapsack
- Bounded Knapsack
- Subset Sum
- Equal Partition
- Target Sum
- Longest Common Subsequence - LCS
- Longest Common Substring
- Edit Distance
- Longest Palindromic Subsequence
- Palindrome Partitioning
- Longest Increasing Subsequence - LIS
- Number of LIS
- Maximum Sum Increasing Subsequence
- Matrix Chain Multiplication
- Burst Balloons
- Optimal BST
- Diameter (Tree DP)
- Maximum Path Sum (Tree DP)
- Tree Independent Set
- Traveling Salesman Problem
- Assignment Problems
- Counting Numbers (Digit DP)
- Digit Constraints
Advanced Data Structures
- AVL Tree
- Red-Black Tree
- B-Tree
- B Plus Tree
- Segment Tree
- Lazy Propagation
- Fenwick Tree / BIT
- Sparse Table
- Disjoint Set Union (Advanced)
- Interval Tree
- Ordered Set / Ordered Map
- Skip List
Advanced Algorithms
- Tarjan's Algorithm
- Kosaraju's Algorithm
- Dijkstra (Advanced)
- Bellman-Ford (Advanced)
- Floyd-Warshall (Advanced)
- A* Search
- KMP (Advanced)
- Z Algorithm (Advanced)
- Manacher (Advanced)
- Rabin-Karp (Advanced)
- Boyer-Moore
- Kruskal (Advanced)
- Prim (Advanced)
- Ford-Fulkerson
- Edmonds-Karp
- Dinic
- Hopcroft-Karp
- Convex Hull (Advanced)
- Line Sweep
- Meet in the Middle
- Mo's Algorithm
- Heavy-Light Decomposition
- Centroid Decomposition
Computational Geometry
- Points / Lines
- Distance
- Orientation
- Cross Product
- Dot Product
- Line Intersection
- Segment Intersection
- Convex Hull
- Graham Scan
- Monotonic Chain
- Closest Pair
- Sweep Line
Range Query Techniques
- Prefix Sum (Range Query)
- Difference Array (Range Query)
- Sparse Table (Range Query)
- Segment Tree (Range Query)
- Lazy Segment Tree
- Fenwick Tree (Range Query)
- Mo's Algorithm (Range Query)
Important Problem-Solving Patterns
- Two Pointers (Pattern)
- Sliding Window (Pattern)
- Fast & Slow Pointer (Pattern)
- Prefix Sum (Pattern)
- Difference Array (Pattern)
- Binary Search on Answer (Pattern)
- Merge Intervals (Pattern)
- Monotonic Stack (Pattern)
- Monotonic Queue (Pattern)
- Top K Elements (Pattern)
- BFS / DFS (Pattern)
- Multi-source BFS
- 0-1 BFS
- Topological Sorting (Pattern)
- Union-Find (Pattern)
- Greedy (Pattern)
- Backtracking (Pattern)
- Memoization (Pattern)
- Tabulation
- Divide & Conquer (Pattern)
- Bitmasking (Pattern)
- Meet in the Middle (Pattern)
- Sweep Line (Pattern)
- Coordinate Compression
- State Compression