You are on level: Student
Overview
Basic Data Structures
Basic Algorithms
Same Direction
Opposite Direction
Sliding Window
Cycle Finding
DFS on Tree
Binary Search Tree
Combinatorial Search
Additional States
Aggregation and Memoization
Additional Practices
Speedrun
Vanilla BFS
Matrix as Graph
Implicit Graph
Directed Graph / Topological Sort
Weighted Graph
Minimum Spanning Tree
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
Monotonic Stack
Line Sweep
Tree Traversal without Recursion
Amazon OA
Microsoft OA
Google OA
Editorials
3-min video breakdowns of Blind 75 problems.
Cover more problems with less effort. Perfect for spare moments or focused study.
You can update your schedule later
Begin today and be fully prepared by April 11, 2026
✨ Updates
Dynamic Programming Module Expansion
Fixed various minor bugs and improved overall stability.
We're excited to announce a new course: How LLMs Work — a comprehensive guide for developers who want to understand large language models from the ground up, without needing a machine learning background. The course covers four modules:
Each module includes interactive visualizations and clear code examples, helping you build intuition for how modern AI systems actually work.
New Foundation Course
Add Complete button in lite problems page.
✨ Upgraded the interview-guides page with improved layout and content updates.