Data Structures & Algorithms
Master essential data structures and algorithms for coding interviews and competitive programming.
Make this roadmap your plan
Sign in to save your routine, streaks, notes, and progress across devices.
Fundamentals
Build a strong foundation with complexity analysis and basic data structures.
Time & Space Complexity
beginner1hLearn Big-O, Big-Theta, Big-Omega notation. Understand amortized analysis and how to evaluate algorithm efficiency.
Arrays & Strings
beginner2h 30mHashing
beginner1h 30mSorting Algorithms
beginner2hRecursion & Divide and Conquer
intermediate2hMathematical Foundations
intermediate1h 30mCore Structures
Deep dive into essential data structures used in every codebase.
Linked Lists
beginner2hStacks & Queues
intermediate2hTrees & Binary Search Trees
intermediate3hHeaps & Priority Queues
intermediate1h 30mTries
intermediate1hDisjoint Set Union (Union-Find)
intermediate1hGraphs
Master graph representations and traversal algorithms.
Graph Representations
intermediate1hBFS & DFS
intermediate2hShortest Path Algorithms
advanced2h 30mTopological Sort & MST
advanced1h 30mAdvanced Graph Algorithms
advanced2h 30mDynamic Programming
Learn to solve optimization problems using overlapping subproblems.
DP Foundations
intermediate2h1D DP Patterns
intermediate2h 30m2D DP & Grid Problems
advanced3hStructural DP
advanced1h 45mState-compression DP
advanced1h 45mDP Optimization Techniques
advanced2hAdvanced Algorithms
Greedy approaches, backtracking, and specialized techniques.
Greedy Algorithms
intermediate2hBacktracking
intermediate2hBinary Search Advanced
intermediate1h 30mBit Manipulation
intermediate1h 30mAdvanced Data Structures
Specialized data structures for competitive programming and system design.
Segment Trees
advanced3hFenwick Tree (BIT)
advanced1h 30mSparse Table & RMQ
advanced1hAdvanced Trees
advanced2hString Algorithms
Advanced string processing and pattern matching algorithms.