Data Structures & Algorithms Curriculum
Select any topic below to step into our interactive dual-view learning dashboard. Every single topic contains step-by-step visual state animations, voice narration, and live line-by-line execution tracking.
1. Programming & Math Fundamentals
Variables, Control Flow & Functions
Master foundational logic, loops, conditional execution, and function execution stacks.
Time & Space Complexity Analysis
Analyze Big-O, Big-Ω, Big-Θ bounds, recursion call trees, and space tradeoffs.
Mathematics for DSA
Primes, GCD/LCM, Modular Arithmetic, Sieve of Eratosthenes, Fast Exponentiation.
2. Linear Data Structures & Strings
Arrays (Basic, Intermediate & Advanced)
Prefix Sum, Kadane’s, Sliding Window, Two Pointers, Sparse Table & Mo’s Algorithm.
Strings & Advanced String Algorithms
Frequency Counting, Anagrams, KMP, Rabin-Karp, Z-Algorithm, Manacher’s & Suffix Automaton.
Singly, Doubly & Circular Linked Lists
Pointer manipulation, cycle detection, list reversal, LRU Cache, and list cloning.
Stacks & Monotonic Stacks
Infix/Postfix conversion, Next Greater Element, Stock Span & Largest Rectangle.
Queues, Deques & Priority Queues
Circular queues, double-ended queues, sliding window maximums, and BFS pipelines.
3. Searching & Sorting Algorithms
Searching Algorithms
Binary Search, Binary Search on Answer, Ternary Search, Exponential & Interpolation Search.
Sorting Algorithms (Elementary to Advanced)
Bubble, Insertion, Merge, Quick, Heap, Radix, Bucket, Tim Sort & In-Place stability.
4. Recursion, Hashing & Trees
Recursion & Backtracking
Call stack trees, Tail Recursion, Tower of Hanoi, N-Queens, Sudoku & Permutations.
Hashing & Hash Tables
Collision handling, chaining, open addressing, frequency maps, and subset grouping.
Binary Trees & Traversals
Preorder, Inorder, Postorder, Level-Order, Diameter, LCA, Boundary & Zigzag Traversals.
Binary Search Trees (BST)
Search, Insert, Delete, Floor/Ceil, Kth Smallest, BST validation, and recovery.
Heaps & Priority Queues
Min/Max Heapify, Top K Frequent, Median in Stream, and Merge K Sorted Lists.
Trie & Prefix Trees
Prefix search, Auto-complete engines, Bitwise XOR Tries, and dictionary lookups.
5. Graphs & Network Algorithms
Graphs (Traversals, Paths & MST)
BFS, DFS, Dijkstra, Bellman-Ford, Floyd-Warshall, Prim’s, Kruskal’s & Kahn’s Topological Sort.
Disjoint Set Union (DSU)
Union by Rank/Size, Path Compression, dynamic connectivity, and Kruskal integration.
Advanced Graph Algorithms
Network Flow (Ford-Fulkerson, Dinic’s), Tarjan’s SCC, Heavy-Light Decomposition & LCA Binary Lifting.
6. Dynamic Programming & Paradigms
Greedy Algorithms
Activity Selection, Fractional Knapsack, Huffman Coding, Interval Scheduling & Gas Station.
Dynamic Programming (1D, 2D & Advanced)
Memoization vs Tabulation, 0/1 Knapsack, LIS, LCS, Digit DP, Tree DP, Bitmask DP & Monotonic Queues.
Bit Manipulation & Bitmasks
Bitwise operations, Single Number, Power of Two, XOR Basis & State Bitmasking.
7. Advanced Data Structures & Competitive Programming
Segment Tree & Lazy Propagation
Range Sum, Range Minimum, Point Updates, Range Updates & Persistent Segment Trees.
Fenwick Tree (Binary Indexed Tree)
Prefix Sums, Point Updates, Range Queries & 2D BIT implementations.
Advanced Self-Balancing Trees
AVL, Red-Black Trees, Treaps, Splay Trees, KD-Trees & B/B+ Trees.
Computational Geometry
Convex Hull (Graham Scan, Jarvis March), Line Sweep, Orientation Tests & Closest Pair.
CP Techniques & Interview Patterns
Matrix Exponentiation, Sprague-Grundy Game Theory, Modular Inverses & Top 18 Interview Patterns.