You are on level: Student
Overview
Quick DSA Review
Basic Algorithms
Sorted Array
Implicitly Sorted Array
Advanced
Speedrun
Core Concepts
Same Direction
Opposite Direction
Sliding Window
Prefix Sum
Cycle Finding
Decision Making
Introduction
DFS on Tree
Binary Search Tree
Combinatorial Search
Additional States
Aggregation and Memoization
Additional Practices
Speedrun
Introduction
Vanilla BFS
Matrix as Graph
Implicit Graph
Directed Graph / Topological Sort
Weighted Graph
Minimum Spanning Tree
Speedrun
Introduction
Top K
Moving Best
Multiple Heaps
Speedrun
Introduction
Constant Transition
Grid
Dual-Sequence
Non-constant Transition
Knapsack, Weight-Only
Knapsack, Weight+Value
Topological Sort
Additional Practices
Disjoint Set Union | Union Find
Data Structure Design
Segment Tree
Speedrun
Interval
Monotonic Stack
Tree Traversal without Recursion
Speedrun
Amazon OA
Microsoft OA
Google OA
For each problem, you answer one multiple choice question about how a heap solves it: a min-heap or a max-heap, the key to order by, when to push, and when to pop. For a full explanation of the format, see the Speedrun overview.
This speedrun covers the three heap patterns of the course: Top K, Moving Best, and Multiple Heaps. Before you start, complete the Priority Queue / Heap chapter.