A curated knowledge base connecting standard DSA with real-world System Design and CS Fundamentals.
DSA Foundation
The absolute best roadmap for standard DSA. Covers everything from Arrays to Hard Graphs.
Product & Design
Don't ignore this! Essential for SDE-2 and Product companies (Google, Uber). Learn Scalability.
Pattern Logic
Focuses on patterns. If you know the syntax but can't find the logic, do this roadmap.
CS Fundamentals
OS, DBMS, and Networks. Product companies grill you on threads, locks, and indexing.
"Can you scale it?"
Product companies don't just want code that passes test cases; they want efficient, readable, and scalable code.
DSA optimizes **Time & Space**. System Design optimizes **Availability & Throughput**. You need both.
Linear structures. Move start/end pointers to find pairs, reverse, or merge sorted arrays.
Subarrays/Substrings. Expand window to satisfy condition, shrink to optimize size.
Cycle detection (Linked List/Array). Middle of list. Happy Number problems.
Next Greater Element. Daily Temperatures. Largest Rectangle in Histogram.
Optimization problems. When asked 'Minimize the Maximum' or 'Smallest capacity'.
Dependencies. Course Schedule problems. Build order. Cycle detection in directed graphs.
Permutations, Subsets, Sudoku Solver. Generate all possibilities and prune invalid paths.
Shortest path in Grid/Graph. Multi-source BFS (Rotting Oranges). 0-1 BFS.
Interview preparation (beginner to intermediate)
A structured breakdown of 150 problems organized by pattern. Each problem includes video explanations and optimized solutions. The Blind 75 subset covers the most frequently asked interview questions across FAANG companies.
Open ResourceIntermediate practitioners seeking pattern recognition
A comprehensive spreadsheet categorizing 200+ problems into 14 core patterns. Includes difficulty ratings and links to LeetCode problems. Effective for identifying which patterns require more practice.
Open ResourceComprehensive DSA learning (beginner to advanced)
A complete roadmap with 450+ problems covering every major topic from basic arrays to advanced graph algorithms. Each section includes theory explanations, problem sets, and video tutorials.
Open ResourceInterview preparation with focus on pattern mastery
A Google Sheet with 250+ problems organized by company frequency and pattern type. Includes columns for tracking progress, notes, and solution approaches. Particularly useful for targeting specific companies.
Open ResourceComprehensive interview preparation
450 problems categorized by topic and difficulty. Focuses on building strong fundamentals before progressing to advanced patterns. Includes time complexity expectations for each problem.
Open ResourceCormen, Leiserson, Rivest, Stein
Level: Intermediate to advanced
The canonical reference for algorithm design and analysis. Comprehensive coverage of sorting, graph algorithms, dynamic programming, NP-completeness, and complexity theory. Dense but authoritative.
Access BookJeff Erickson (University of Illinois)
Level: Intermediate
A freely available textbook covering recursion, backtracking, dynamic programming, greedy algorithms, and graph algorithms. Written with clarity and includes extensive problem sets. Particularly strong on explaining algorithmic thinking.
Access BookAntti Laaksonen
Level: Beginner to intermediate CP
A concise 300-page guide covering essential competitive programming techniques. Topics include number theory, graph algorithms, range queries, and geometry. Includes code examples in C++.
Access BookCP-Algorithms community
Level: Intermediate to advanced
An extensive wiki-style resource documenting advanced algorithms with mathematical proofs and implementation details. Covers segment trees, suffix structures, FFT, flows, and string algorithms. Essential reference for competitive programmers.
Access BookCompetitive programming beginners through advanced
A complete roadmap from basic programming to IOI-level competitive programming. Organized into modules by difficulty (Bronze, Silver, Gold, Platinum). Each module includes theory, practice problems, and editorial solutions. Covers standard algorithms systematically.
View RoadmapInterview preparation with 8-week study plan
A systematic study plan covering essential interview topics. Organized by pattern with time allocation recommendations. Includes behavioral interview preparation and system design fundamentals. Created by Yangshun Tay.
View RoadmapInterview preparation with time constraints
An adaptive question list that adjusts based on available study time. Focuses on high-frequency interview questions with optimal time investment. Covers fundamental patterns with increasing difficulty.
View Roadmap"Focuses on optimizing Hard problems. Often asks variations of standard graph/DP problems that require modeling."
by The Holy Bible of CP
Detailed explanations of advanced algo (Segment Trees, Suffix Automata).
by Sean Prashad
A legendary blog post breaking down the 14 patterns to ace any coding interview.
by Real Architecture
Case studies on how WhatsApp, YouTube, and Netflix scaled to millions.
by Mike Bostock
Beautiful visualizations of Sampling, Sorting, and Mazes. Build mental models.
"The best time to plant a tree was 20 years ago. The second best time is now."
Found a bug 🐞, have an idea 💡, or want a new feature 🚀?
Your feedback helps make DSA Quest better for everyone!
Made with 💜 for competitive programmers