PIXELBANKv8.2.1
Menu
Sign In
Ace Your Coding Interviews

DSA (Data Structures & Algorithms) Study Plan

A comprehensive 13-week curriculum covering data structures and algorithms from fundamentals to advanced interview patterns. Binary search, trees, graphs, dynamic programming, and more.

13 Chapters13 WeeksInteractive Demos

Recommended Study Path

Phase 1

Fundamentals

Week 1

  • Ch 1: Data Structures & Sorting

Stacks, queues, hash maps, merge/quick sort

Phase 2

Core Patterns

Weeks 2-4

  • Ch 2: Binary Search
  • Ch 3: Two Pointers & Windows
  • Ch 4: DFS & Trees

Most frequently tested interview patterns

Phase 3

Graph & Search

Weeks 5-9

  • Ch 5-6: Backtracking & BFS
  • Ch 7-8: Graphs & Advanced Graphs
  • Ch 9: Heaps & Priority Queues

Topological sort, Dijkstra's, heaps

Phase 4

DP & Advanced

Weeks 10-13

  • Ch 10-11: Dynamic Programming
  • Ch 12: Union Find, Trie, LRU
  • Ch 13: Intervals, Greedy, Patterns

Knapsack, monotonic stack, line sweep

Tip: Each chapter includes interactive demos and coding challenges.
Pro chapters (5-13) require a premium subscription.

All Chapters

1

Fundamentals

Data structures overview, stacks, queues, hash maps, sorting algorithms, merge sort, quick sort, and custom comparators.

Data Structures IntroductionStacksQueues+4
Start Learning
2

Binary Search

Vanilla binary search, sorted boolean arrays, monotonic functions, boundary finding, first occurrence, square root, rotated arrays, and peak finding.

Vanilla Binary SearchSorted Boolean ArrayMonotonic Function+5
Start Learning
3

Two Pointers & Sliding Window

Same/opposite direction pointers, remove duplicates, two sum sorted, palindrome checking, fixed/longest/shortest windows, prefix sums, and cycle detection.

Same & Opposite Direction PointersRemove DuplicatesTwo Sum Sorted+5
Start Learning
4

Depth First Search & Trees

Recursion review, tree fundamentals, DFS on trees, max depth, balanced trees, inverting trees, BST operations, and lowest common ancestor.

Recursion ReviewTree FundamentalsDFS on Trees+5
Start Learning
5

Backtracking

DFS with states, combinatorial search, pruning strategies, phone letter combinations, valid parentheses, permutations, memoization, and deduplication.

DFS with StatesCombinatorial SearchPruning+5
Start Learning
6

Breadth First Search

BFS fundamentals, level-order traversal, zigzag traversal, binary tree right side view, and minimum depth of binary tree.

BFS FundamentalsLevel-Order TraversalZigzag Level Order+2
Start Learning
7

Graphs

Graph fundamentals, BFS/DFS on graphs, shortest path, matrix as graph, flood fill, number of islands, implicit graphs, and word ladder.

Graph FundamentalsBFS on GraphsDFS on Graphs+5
Start Learning
8

Advanced Graphs

Topological sort, task scheduling, alien dictionary, Dijkstra's algorithm, and minimum spanning trees.

Topological SortTask SchedulingAlien Dictionary+2
Start Learning
9

Heaps & Priority Queues

Heap fundamentals, K closest points, merge K sorted lists, Kth largest element, reorganize string, and median from data stream.

Heap FundamentalsK Closest Points to OriginMerge K Sorted Lists+3
Start Learning
10

Dynamic Programming Basics

DP introduction, climbing stairs, house robber, grid-based DP, unique paths, minimum path sum, and maximal square.

DP IntroductionClimbing StairsHouse Robber+4
Start Learning
11

Dynamic Programming Advanced

Dual-sequence DP (LCS, edit distance), longest increasing subsequence, knapsack problems (0/1, unbounded, coin change), and partition equal subset sum.

Longest Common SubsequenceEdit DistanceLongest Increasing Subsequence+3
Start Learning
12

Advanced Data Structures

Union Find, connected components, Trie data structure, autocomplete with tries, LRU Cache design, and segment trees.

Union FindConnected ComponentsTrie+3
Start Learning
13

Patterns & Miscellaneous

Interval problems, merge intervals, monotonic stack, sliding window maximum, divide and conquer, greedy algorithms, and line sweep.

Interval ProblemsMerge IntervalsMonotonic Stack+4
Start Learning

Timed Tests

View all
Arrays & Pointers
Ch 1-3 45 min
Trees & Search
Ch 4-6 45 min
Graphs
Ch 7-8 45 min
Heaps & DP Basics
Ch 9-10 45 min
DP & Advanced
Ch 11-13 45 min
Check Progress

Practice Problem Sets

Sharpen your skills with coding challenges and system design problems.

Suggestion from founder: Think of DSA (Data Structures & Algorithms) as something you need to be aware of — this is not based on IQ. You will not get the right answer until you learn all the patterns. Master the patterns, and the problems become familiar.

Curriculum inspired by algo.monster, designed to take you from DSA (Data Structures & Algorithms) fundamentals to acing coding interviews.