DSAspire
HomeTopicsPatternsCompaniesSheetsRoadmapsAbout
Sign inGet started
DSAspire

Free Data Structures & Algorithms learning and coding-interview preparation platform.

Learn

  • Topics
  • Patterns
  • Roadmaps
  • Sheets

Practice

  • Companies
  • Blind 75
  • Dashboard
  • Sign in

Company

  • About
  • Contact

© 2026 DSAspire. All rights reserved.

Master DSA, one pattern at a time.

Structured learning paths

DSA Roadmaps

Complete learning guides — not just topic lists. Each roadmap shows what you'll learn, what you need first, and exactly what you'll achieve, with curated problems and company-tagged practice.

5 roadmaps Beginner → Expert 900+ curated problems

DSA Foundations

Build unshakeable fundamentals from zero

Beginner

Start here if you're new to Data Structures & Algorithms. Master the core structures and the problem-solving instincts you'll rely on for everything that follows.

9 Topics
140 Problems
70 LeetCode
11 Modules
8 wks · 45h
Sign into track your completion progress.
COVERS
ArraysStringsRecursionLinked ListStackQueueSortingBinary SearchHashing
Start Roadmap View All TopicsPractice Problems

✅Prerequisites

  • Basic programming in C++, Java or Python
  • Variables, loops & conditionals
  • Functions & basic recursion
  • Basic mathematics

🎯What You'll Learn

  • Read and reason about time & space complexity
  • Solve easy–medium problems confidently
  • Recognise the core data-structure toolkit
  • Build a daily problem-solving habit

💼Best For

Absolute beginnersCollege studentsSelf-taught developersPlacement prep (early)

📈Learning Outcomes

  • 140+ practice problems
  • 70+ LeetCode problems
  • 9 core topics
  • A solid base for interviews

🛠Recommended Resources

NotesVideo PlaylistArticlesPractice Sheets

🏢Companies Covered

AM
Amazon
MI
Microsoft
AD
Adobe
FL
Flipkart

📊Roadmap Statistics

9
Topics
140
Problems
45h
Est. hours
Beginner
Difficulty
Completion rate82%

FAANG Interview Prep

The complete path to a top-tier offer

Advanced

The high-frequency topics and patterns that dominate interviews at Google, Amazon, Microsoft, Meta and other top companies — end to end, with company-tagged practice.

14 Topics
320 Problems
160 LeetCode
18 Modules
12 wks · 95h
Sign into track your completion progress.
COVERS
ArraysStringsHashingTwo PointersSliding WindowTreesBSTGraphDPGreedyHeapTrieBinary SearchBacktracking
Start Roadmap View All TopicsPractice Problems

✅Prerequisites

  • Comfortable with DSA Foundations
  • Solid time-complexity analysis
  • One language mastered
  • Basic recursion & OOP

🎯What You'll Learn

  • Solve medium & hard problems under time pressure
  • Master the 15 highest-yield interview patterns
  • Communicate approach & complexity clearly
  • Optimise brute-force into optimal solutions

💼Best For

Placement preparationFAANG / MAANG interviewsWorking engineers switching jobsSerious 3–4 month prep

📈Learning Outcomes

  • 320+ interview questions
  • 160+ LeetCode problems
  • 14 core topics
  • An interview-ready pattern toolkit

🛠Recommended Resources

NotesVideo PlaylistArticlesPractice SheetsCompany Questions

🏢Companies Covered

GO
Google
AM
Amazon
MI
Microsoft
ME
Meta
AP
Apple
UB
Uber
AD
Adobe
AT
Atlassian

📊Roadmap Statistics

14
Topics
320
Problems
95h
Est. hours
Advanced
Difficulty
Completion rate64%

Dynamic Programming Mastery

Turn DP from your weakness into your edge

Advanced

DP trips up more candidates than any other topic. Work through it systematically — from memoization and tabulation to advanced state design — until it clicks.

6 Topics
110 Problems
75 LeetCode
12 Modules
5 wks · 45h
Sign into track your completion progress.
COVERS
MemoizationTabulation0/1 KnapsackLCSLISMatrix DPInterval DPTree DPBitmask DPDigit DP
Start Roadmap View All TopicsPractice Problems

✅Prerequisites

  • Strong recursion
  • Arrays & strings
  • Basic graph/tree traversal
  • Time-complexity analysis

🎯What You'll Learn

  • Identify DP problems from their signals
  • Design state & transitions systematically
  • Convert top-down to bottom-up and optimise space
  • Handle interval, tree and bitmask DP

💼Best For

Interview finishersCompetitive programmersAnyone stuck on DPFAANG interviews

📈Learning Outcomes

  • 110+ DP problems
  • 75+ LeetCode problems
  • 10+ DP patterns
  • Deep DP intuition

🛠Recommended Resources

NotesVideo PlaylistArticlesPractice Sheets

🏢Companies Covered

GO
Google
AM
Amazon
UB
Uber
GS
Goldman Sachs
OR
Oracle

📊Roadmap Statistics

6
Topics
110
Problems
45h
Est. hours
Advanced
Difficulty
Completion rate58%

Graph Mastery

Traversals, shortest paths & everything between

Advanced

The graph toolkit that shows up in system-heavy interviews and contests — from BFS/DFS to Dijkstra, union-find and topological sort.

5 Topics
90 Problems
60 LeetCode
10 Modules
4 wks · 38h
Sign into track your completion progress.
COVERS
BFSDFSTopological SortDijkstraBellman-FordUnion-Find (DSU)MSTBridgesSCCShortest Path
Start Roadmap View All TopicsPractice Problems

✅Prerequisites

  • Recursion & stacks/queues
  • Basic trees
  • Time-complexity analysis
  • Comfort with adjacency lists

🎯What You'll Learn

  • Model problems as graphs
  • Apply the right traversal & shortest-path algorithm
  • Use union-find for connectivity
  • Handle DAGs, MSTs and advanced connectivity

💼Best For

Interview prepCompetitive programmingSystem-design-adjacent roundsFAANG interviews

📈Learning Outcomes

  • 90+ graph problems
  • 60+ LeetCode problems
  • 12+ graph algorithms
  • Confident graph modelling

🛠Recommended Resources

NotesVideo PlaylistArticlesPractice SheetsCompany Questions

🏢Companies Covered

GO
Google
AM
Amazon
ME
Meta
MI
Microsoft
DA
Databricks

📊Roadmap Statistics

5
Topics
90
Problems
38h
Est. hours
Advanced
Difficulty
Completion rate61%

Competitive Programming

Go beyond interviews into contest territory

Expert

Number theory, bit tricks, geometry and the math that powers competitive contests — for those aiming at Codeforces, ICPC and beyond.

8 Topics
250 Problems
40 LeetCode
16 Modules
10 wks · 120h
Sign into track your completion progress.
COVERS
Number TheoryModular ArithmeticSieveBit ManipulationCombinatoricsGeometrySegment TreeFenwick TreeGame Theory
Start Roadmap View All TopicsPractice Problems

✅Prerequisites

  • Strong DSA foundations
  • Fluent recursion & DP
  • Solid mathematics
  • Fast implementation skills

🎯What You'll Learn

  • Apply number theory & combinatorics
  • Use advanced structures (segment/Fenwick trees)
  • Solve geometry & game-theory problems
  • Write fast, contest-ready code

💼Best For

Competitive programmersICPC / Codeforces aspirantsAdvanced learnersOlympiad-style problem solvers

📈Learning Outcomes

  • 250+ contest problems
  • 40+ curated LeetCode hard
  • 8 advanced topics
  • Contest-ready speed

🛠Recommended Resources

NotesVideo PlaylistArticlesPractice Sheets

🏢Companies Covered

GO
Google
DS
DE Shaw
DA
Databricks
DI
Directi
PA
Palantir

📊Roadmap Statistics

8
Topics
250
Problems
120h
Est. hours
Expert
Difficulty
Completion rate41%