Track
dsa
DSA
36 lessons: Big-O, STL patterns, graphs, DP—C++17 compile/run playground + 108 MCQs.
- Mode
- server_compiled
- Practice
- Compiled runner
- Lessons
- 36 units
Before you start
Data structures and algorithms: complexity, classic structures, and interview-style problem patterns.
Core CS literacy for efficient code and technical interviews at many companies.
Interview loops, performance tuning, and foundational CS courses.
Compiled-language runner exercises with Big-O explanations and MCQs.
Parallel to your main language track—intensify before internship or job interview season.
Lesson order
Sequential — follow top to bottom36 lessons are live in this track. Start from step 01 for the smoothest path.
-
01 intro Introduction to DSA
beginner
Open → -
02 what-is-dsa What is DSA?
beginner
Open → -
03 dsa-vs-coding-preview DSA vs everyday coding
beginner
Open → -
04 dsa-ecosystem-preview DSA ecosystem preview
beginner
Open → -
05 dsa-workflow DSA problem-solving workflow
beginner
Open → -
06 big-o-intro Big-O introduction
beginner
Open → -
07 time-complexity Time complexity
beginner
Open → -
08 space-complexity Space complexity
beginner
Open → -
09 analyzing-loops Analyzing loops
beginner
Open → -
10 recursion-basics Recursion basics
beginner
Open → -
11 amortized-preview Amortized complexity preview
beginner
Open → -
12 arrays-and-vectors Arrays and vectors
beginner
Open → -
13 two-pointers Two pointers
beginner
Open → -
14 sliding-window Sliding window
beginner
Open → -
15 prefix-sums Prefix sums
beginner
Open → -
16 sorting-basics Sorting basics
beginner
Open → -
17 binary-search Binary search
beginner
Open → -
18 linked-lists-concept Linked lists concept
beginner
Open → -
19 stacks-queues Stacks and queues
beginner
Open → -
20 hash-maps-concept Hash maps concept
beginner
Open → -
21 sets-maps-usage Sets and maps usage
beginner
Open → -
22 strings-dsa Strings for DSA
beginner
Open → -
23 deque-concept Deque concept
beginner
Open → -
24 binary-trees Binary trees
beginner
Open → -
25 tree-traversals Tree traversals
beginner
Open → -
26 bst-basics BST basics
beginner
Open → -
27 heaps-priority-queue Heaps and priority queues
beginner
Open → -
28 graphs-representation Graph representations
beginner
Open → -
29 bfs-dfs BFS and DFS
beginner
Open → -
30 dynamic-programming-intro Dynamic programming intro
intermediate
Open → -
31 greedy-intro Greedy algorithms intro
intermediate
Open → -
32 shortest-path-preview Shortest path preview
intermediate
Open → -
33 union-find-preview Union-Find preview
intermediate
Open → -
34 interview-essentials-dsa Interview essentials for DSA
intermediate
Open → -
35 production-checklist-dsa Production checklist for DSA
advanced
Open → -
36 ai-bridge-lesson AI bridge lesson
intermediate
Open →