Solve every problem in ten minutes, on the first try.
AlgoRung is where your DSA practice lives: a curriculum organised by pattern, a revision schedule for every problem you solve, and notes on every mistake you make along the way.
- Problems
- 684
- Topics
- 14
- Revisions per problem
- 2
subsets([1, 2]) two choices per element, four subsets One problem, three rungs
Solving a problem once proves you understood it that day. AlgoRung schedules two revisions after the first solve, so the pattern is still there in the interview.
-
Sat
Class
Learn the pattern from the session. Watch for the idea, not the code.
-
Sat–Sun
First solve
Code it yourself. When you get stuck, write down where before you look at a solution.
-
Tue
Revision 1
Solve it again from a blank editor. Log your time, attempts and every mistake.
-
Thu
Revision 2
One more clean run. Under ten minutes in one attempt and the problem is yours.
Class on Sunday instead? The schedule shifts with it: first solve Sun–Mon, revisions on Wed and Fri.
The curriculum
684 problems from LeetCode, GeeksforGeeks and NeetCode, grouped by the pattern each one teaches. Follow the roadmap from arrays to dynamic programming, or jump to the topic your next class covers.
-
Arrays & Hashing
195 problemsTwo Sum, Moore's Voting Algorithm, Kadane's Algorithm, Double Reversal Trick, Two Pointer, Right to Left Traversal, In-place Transformations, Merge Sort Like Approach, Dutch National Flag, Prefix Sum Strategy, Sliding Window · Fixed, Sliding Window · Variable, Sliding Window · Hash Map, Hashing, Matrix Traversal, Elimination Recurrence, Greedy, Hash Set Lookup, Simulation, Contribution Technique, String Matching (KMP), Math / Number Theory, Candidate Generation, Fenwick Tree (BIT), String Basics, Sorting
-
Stack
20 problemsStack Basics
-
Monotonic Stack
15 problemsMonotonic Stack
-
Linked List
26 problemsDummy Node Pattern, Slow Fast Pointers, Front Back Pointer, Front Middle Back Pointer, Miscellaneous
-
Binary Search
47 problemsBasics, Bisect, Unique 1-D Binary Search, Rotated Array, 2D Binary Search + Step Search, Search on Answer Range, Binary Search on Answer Space, Binary Search on Partition
-
Recursion & Backtracking
38 problemsBasic Recursion, 2D Matrix, Pick / Not-Pick, Permutations, 2D Matrix Backtracking, Choice per Position, Divide and Conquer, Digit-by-Digit Construction, Meet in the Middle
-
Trees & BST
71 problemsRecursion, Backtracking, Traversals, Views, BST Basics, Postorder + Multiple Return Values, LCA, Child + Ancestor Handling, Reverse Inorder Traversal, Tree Serialization / Deserialization, Tree to Lists and vice-versa, Miscellaneous BST Questions
-
Heaps
26 problemsTop K / Kth Largest / Smallest, Composite comparator, Merge K Sorted, Advanced
-
Intervals
21 problemsBasics, Line Sweep, Segment Tree
-
Tries
8 problemsBasics, Trie + Backtracking, Bitwise Trie
-
Graphs
75 problemsBFS / DFS Basics, Matrix Graphs, Connected Components, BFS for shortest path, DFS - Complement Trick, Multi source BFS, Cycle Detection, Topological Sort, Dijkstra, Eulerian Path (Hierholzer), Candidate Elimination, Re-rooting DP, Minimum Spanning Tree, Degree Counting
-
Dynamic Programming
81 problems1D DP, Alternate Selection / Pick / Not pick, 2D DP, 2D DP - max/min of last row, Squares, State Machine DP - Stock Problems, Knapsack, Strings, Interval DP, Tree DP, Bitmask DP, Combinatorics
-
Bit Manipulation
25 problemsBasics, Tricks to remember, XOR Basics, Missing / Repeated Numbers, Sum over Subsets (SOS) DP, Math / Number Theory
-
Design Data Structures
36 problemsPre-processing + tradeoffs, Linked Lists, Stack, Queue / Circular Buffer, Hash Map + Array, Hash Map + Heap, Randomized Algorithms, Dependency Graph, Concurrency, Simulation
A method for every problem
The same eight steps, whether it's Two Sum or Burst Balloons. Talk before you type. Brute force before you optimise.
- Read the question twice.
- Run an example to check you understood it.
- List the edge cases.
- Find a brute force and test it on those edge cases.
- Explain the approach with its time and space complexity.
- Optimise, then test the edge cases again.
- Explain the optimised approach and its complexity.
- Code it.
Subsets II
Pick / Not-Pick, Recursion & Backtracking
Skipped duplicates at every depth instead of only among siblings.
// sort first, skip equal siblings only
for (int i = start; i < nums.length; i++) {
if (i > start && nums[i] == nums[i - 1]) continue;
path.add(nums[i]);
backtrack(nums, i + 1, path, out);
path.remove(path.size() - 1);
} Beyond DSA
The same animated walkthroughs, notes and interview questions for system design and AI engineering, plus short posts on working with coding agents.
-
System Design
Animated, narrated episodes on the concepts, technologies, building blocks and classic design problems, plus a practice board.
173 episodes → -
Low Level Design
The foundations every machine coding round tests: object-oriented programming, the SOLID principles, all 23 classic design patterns, class diagrams, clean design principles and thread safety.
48 episodes → -
AI Engineering
How LLM-powered software is built: agents, tool calling, retrieval, memory, guardrails and evals.
5 episodes → -
Tips & Tricks
Short, practical posts on getting real work out of coding agents: better tasks, planning, skills, context and tests.
5 posts →