Home / DSA

/dsa · TRACK

The DSA track.

Data structures and algorithms — arrays, trees, graphs, dynamic programming and more. Built as a curriculum — 25 chapters, recommended spine if you're new, side-quests when you're ready.

⏱ ~22h 59m total 32 beginner · 99 intermediate · 66 advanced 📚 197 topics

You'll cover: Arrays & Strings, Linked List, Stack & Queue — then go deeper.

Start here: Array Data Structure → Two Pointer Technique → Sliding Window Technique →

Continue from Array Data Structure → Complete DSA guide

Your progress 0 / 197 topics

Read

Chapters done

Time invested

🔥 Start your streak today

CURRICULUM

25 chapters · 197 topics

Arrays & Strings

SPINEIntermediate

13 topics · ~1h 31m · 0/13 read

Array Data Structure Two Pointer Technique Sliding Window Technique Prefix Sum Array Kadane's Algorithm+8 more

Linked List

SPINEIntermediate

11 topics · ~1h 17m · 0/11 read

Singly Linked List Doubly Linked List Circular Linked List Reverse a Linked List Detect Loop in Linked List+6 more

Stack & Queue

SPINEIntermediate

10 topics · ~1h 10m · 0/10 read

Stack Data Structure Queue Data Structure Priority Queue and Heap Deque — Double Ended Queue Monotonic Stack Pattern+5 more

Trees

SPINEAdvanced

15 topics · ~1h 45m · 0/15 read

Binary Tree Binary Search Tree Tree Traversals — Inorder Preorder Postorder Level Order Traversal of Binary Tree Height and Depth of Binary Tree+10 more

Graphs

SPINEAdvanced

18 topics · ~2h 6m · 0/18 read

Graph Representation BFS — Breadth First Search DFS — Depth First Search Dijkstra Shortest Path Algorithm Bellman-Ford Algorithm+13 more

Sorting

SPINEBeginner

8 topics · ~56m · 0/8 read

Bubble Sort Selection Sort Insertion Sort Merge Sort Quick Sort+3 more

Searching

SPINEBeginner

8 topics · ~56m · 0/8 read

Binary Search Algorithm Binary Search on Answer Linear Search Algorithm Ternary Search Algorithm Jump Search Algorithm+3 more

Dynamic Programming

SPINEAdvanced

17 topics · ~1h 59m · 0/17 read

Introduction to Dynamic Programming Memoization vs Tabulation 0/1 Knapsack Problem Longest Common Subsequence Longest Increasing Subsequence+12 more

Hashing

SPINEIntermediate

13 topics · ~1h 31m · 0/13 read

Hash Table and Hash Map Hash Collisions and Resolution Two Sum Problem using Hashing Group Anagrams Problem Longest Consecutive Sequence+8 more

Greedy & Backtracking

SPINEIntermediate

13 topics · ~1h 31m · 0/13 read

Greedy Algorithm Introduction Activity Selection Problem Huffman Coding Backtracking Introduction N-Queens Problem+8 more

Complexity Analysis

SPINEIntermediate

6 topics · ~42m · 0/6 read

Big O Notation Explained Time Complexity Analysis Space Complexity Analysis Amortized Analysis Space Complexity: How to Analyze Memory Usage in Algorithms+1 more

Recursion

SPINEIntermediate

9 topics · ~1h 3m · 0/9 read

Introduction to Recursion Recursion vs Iteration Tower of Hanoi Problem Divide and Conquer Technique Divide and Conquer — Strategy and Patterns+4 more

Strings

SPINEIntermediate

9 topics · ~1h 3m · 0/9 read

String Searching Algorithms Overview KMP Algorithm — Knuth-Morris-Pratt String Matching Z-Algorithm for Pattern Matching Boyer-Moore String Search Algorithm Manacher's Algorithm — Longest Palindromic Substring+4 more

Number Theory

SPINEBeginner

6 topics · ~42m · 0/6 read

Sieve of Eratosthenes — Prime Number Generation GCD and LCM — Euclidean Algorithm Prime Factorization and Divisors Modular Arithmetic — ModExp, ModInverse, Fermat's Theorem Chinese Remainder Theorem+1 more

Scheduling

SPINEBeginner

4 topics · ~28m · 0/4 read

FCFS Scheduling — First Come First Served SJF Scheduling — Shortest Job First Round Robin Scheduling Algorithm Priority Scheduling and Aging

Data Compression

Advanced

4 topics · ~28m · 0/4 read

Run-Length Encoding — Lossless Compression LZ77 and LZ78 — Dictionary Compression Algorithms Burrows-Wheeler Transform Arithmetic Coding — Beyond Huffman

Numerical Analysis

Intermediate

3 topics · ~21m · 0/3 read

Newton-Raphson Method — Root Finding Bisection Method — Numerical Root Finding Numerical Integration — Simpson's Rule and Trapezoidal

Cryptography

Advanced

10 topics · ~1h 10m · 0/10 read

Caesar Cipher — Substitution Encryption Vigenère Cipher — Polyalphabetic Encryption RSA Algorithm — Public Key Cryptography Diffie-Hellman Key Exchange AES — Advanced Encryption Standard+5 more

Geometry

Intermediate

4 topics · ~28m · 0/4 read

Line Intersection and Orientation Polygon Area — Shoelace Formula Point in Polygon — Ray Casting Algorithm Rotating Calipers — Diameter and Width

Linear Algebra

Intermediate

5 topics · ~35m · 0/5 read

Matrix Operations — Addition, Multiplication, Transpose Gaussian Elimination — Solving Linear Systems LU Decomposition Eigenvalues and Eigenvectors Singular Value Decomposition — SVD

Genetic Algorithms

Intermediate

2 topics · ~14m · 0/2 read

Genetic Algorithms — Evolution-Based Optimisation Simulated Annealing — Probabilistic Optimisation

Quantum Algorithms

Advanced

4 topics · ~28m · 0/4 read

Quantum Computing Fundamentals for Developers Deutsch-Jozsa Algorithm Grover's Search Algorithm — Quantum Speedup Shor's Algorithm — Quantum Factoring

Arrays

Intermediate

3 topics · ~21m · 0/3 read

Best Time to Buy and Sell Stock Three Sum Triplet Problem Container With Most Water

Stacks & Queues

Advanced

1 topics · ~7m · 0/1 read

Trapping Rain Water Problem

Greedy

Intermediate

1 topics · ~7m · 0/1 read

Jump Game Greedy Algorithm

The DSA track.

DSA interview prep

25 chapters · 197 topics

Arrays & Strings

Linked List

Stack & Queue

Trees

Graphs

Sorting

Searching

Dynamic Programming

Hashing

Greedy & Backtracking

Complexity Analysis

Recursion

Strings

Number Theory

Scheduling

Data Compression

Numerical Analysis

Cryptography

Geometry

Linear Algebra

Genetic Algorithms

Quantum Algorithms

Arrays

Stacks & Queues

Greedy

Arrays & Strings