About AlgoRung
AlgoRung helps you learn data structures and algorithms for coding interviews, and keep what you learn.
Why it exists
Solving a problem once is easy to mistake for knowing it. A week later the idea is gone and the same problem feels new. AlgoRung is built around that gap: every solve schedules two revisions, and every mistake is written down, so the problems you practise stay with you until the interview.
What's inside
- 231 problems across 14 topics, ordered from arrays and strings to graphs and dynamic programming.
- 76 patterns. Each topic is split into the ideas it teaches, so you practise the pattern behind a problem and not just the problem.
- Write-ups in our own words for every problem: the task, worked examples, constraints, edge cases and hints.
- Java solutions from brute force to optimal, each with its time and space complexity and the reasoning behind it.
- 231 animated walkthroughs, each about eight to ten minutes with narration. Every number on screen is computed by running the real algorithm, so the picture always matches the code.
- A revision log that schedules two revisions per solve and keeps your time, attempts, mistakes and notes.
Who it's for
Students and working engineers preparing for coding interviews, and anyone following a DSA course who wants a structured way to practise between classes. You don't need an account to read problems, solutions or walkthroughs; an account only stores your revision log.
Where else to find us
Every walkthrough is also published on the AlgoRung YouTube channel, along with short versions for quick revision.
About the problems
Problem names refer to well-known interview questions, most of which are hosted on LeetCode or GeeksforGeeks. Every write-up on AlgoRung is written independently, and each problem page links to the original so you can submit your code there. AlgoRung is not affiliated with LeetCode or GeeksforGeeks.
Found a mistake?
Write to hello@algorung.com with the problem name and what looks wrong. Corrections are usually live within a day.