Data Structures
Practice stacks, linked lists, matrices, trees, and graph traversal in a deliberate order.
Outcome: Recognize structure-specific invariants and traversal strategies.
Recommended first: Coding Foundations
Module 1: Stacks & Linked Lists
Manage explicit and pointer-based state.
Module 2: Trees & Search Trees
Traverse tree structure and maintain recursive ordering invariants.
Module 3: Matrices & Graphs
Use DFS, BFS, topological sorting, union-find, and shortest paths.
1
Spiral Matrix
Not started
2
Number of Islands
Not started
3
Rotting Oranges
Not started
4
Clone Graph
Not started
5
Pacific Atlantic Water Flow
Not started
6
Course Schedule
Not started
7
Alien Dictionary
Not started
8
Redundant Connection
Not started
9
Connected Components in an Undirected Graph
Not started
10
Accounts Merge
Not started
11
Word Ladder
Not started
12
Network Delay Time
Not started
13
Cheapest Flights Within K Stops
Not started
14
Longest Increasing Path in a Matrix
Not started
Module 4: Heaps, Fenwick Trees & Priority Queues
Retain the most useful candidates without sorting everything, and maintain efficient partial aggregates.
1
Kth Largest Element in an Array
Not started
2
Top K Frequent Elements
Not started
3
K Closest Points to Origin
Not started
4
Meeting Rooms II
Not started
5
Task Scheduler
Not started
6
Merge K Sorted Lists
Not started
7
Find Median from Data Stream
Not started
8
Range Sum Query - Mutable
Not started
Module 5: Tries & Stateful Design
Share prefixes and model operation-driven data structures.
