Coding interview prep in Python
Practise what you’re actually missing
A problem list gives everyone the same problems in the same order. Codingo reads every submission, names the mistake you keep making, and picks the problem that fixes it. Then it tells you why.
Nothing to install. The check and the pattern lessons are free without an account.
shortest_streak.py
Run testsHidden test failed. [2, 3, 1, 2, 4, 3], target 7: expected 2, got 4.
Shrinks the window only once. while keeps shrinking until the total drops below the target. Third time this week.
Your next problem
Shortest Strong Mix
Picked because it only passes if the window keeps shrinking, so it catches this exact mistake.
How it picks your next problem
The tutor keeps a model of your skills, the mistakes you repeat and the cases you miss, and plans each problem around it. You always see why it picked the one in front of you.
- 1
A readiness check, not a questionnaire
15 quick questions (spot the bug, name the pattern, judge the cost) set your starting level in each area from what you can actually do, so you skip what you know.
- 2
Every problem has a reason
The next problem is the one that best fits your level and your weak spots, and it says why: a mistake you keep making, a case you missed, a part of a pattern you have not solved yet.
- 3
Weak spots tracked, then retired
Mistakes, edge cases and sub-patterns are tracked separately. They fade when you solve problems built to catch them, and mastered patterns come back for a refresher before you forget them.
- 4
A plan to your interview date
Give it the date and your daily time. It lays out the patterns week by week, weakest first, keeps you on pace, and adjusts as you improve. Retake the check to see how far you have come.
See the whole path, not just the next problem
Interviews draw on a known set of 56 patterns that build on each other. You master them variant by variant, until you recognise one in a problem that never names it.
Your map shows where you stand, what each pattern unlocks, and why the tutor picks what it picks.
- Mastered
- In progress
- Ready or waiting on prerequisites
Rehearse the real thing, then see what to fix
An unseen problem, a 30, 45 or 60-minute timer, no hints and no pattern label. You write down your plan, code it, and name the pattern you used.
The debrief scores what an interviewer would: correctness on hidden tests, time, pattern recognition, edge cases, complexity and how clearly you explained your approach.
Interview debrief, 45 minutes
Passed
Fruit Stand Basket
- CorrectnessGood
- 12 of 12 tests passed, hidden ones included.
- TimeGood
- 38:05 of 45:00.
- Pattern recognitionWork on it
- You said Two Pointers; the intended pattern is Sliding Window (Variable Size).
- Edge casesGood
- All edge cases handled.
- ComplexityGood
- Fast enough: meets the O(n) target.
- CommunicationPartly there
- Your plan grew the window but never said when to shrink it.
Why not LeetCode with a list?
The list is a good syllabus. It can’t see that you keep missing empty inputs, or that you only solve sliding windows when you’re told it’s a sliding window.
| Feature | Codingo | LeetCode and a list | Chatbots |
|---|---|---|---|
| Starts from a readiness check, not a fixed list | Yes | No | No |
| Picks the next problem for you, and says why | Yes | No | No |
| Tracks your recurring mistakes and missed edge cases | Yes | No | No |
| Mastery per pattern and sub-pattern, with refreshers | Yes | No | No |
| A day-by-day plan to your interview date | Yes | Partly. A fixed list, not your pace | Partly. If you ask; not tracked |
| Timed mock interviews with a coaching debrief | Yes | Partly. Timed, score only (Premium) | Partly. No timer or tests |
| Hints that step up but never give away the solution | Yes | Partly. Fixed hints on some problems | Partly. Often slips into the answer |
| Checks your code against hidden, validated tests | Yes | Yes | Partly. Runs code, but not a validated test suite |
| A verified solution to compare with after you solve | Yes | Yes | Partly. Explains, but unverified |
As of 2026, compared with LeetCode’s own features and general-purpose AI chatbots.
Learn a pattern in five minutes
Optional theory when you want it: the core idea, when to reach for it, a template, variants and common mistakes. Mastery still comes from practice. No account needed.
- Hash Map LookupStore what you have seen so each new element can be answered in O(1).
- Sliding Window (Variable Size)Grow the window with the right pointer, shrink with the left until it is valid again.
- Two Pointers (Opposite Ends)Move two indices toward each other on sorted or symmetric data.
- Monotonic StackKeep a stack in sorted order to find the next greater/smaller element for all items in O(n).
- Binary Search on the AnswerSearch the smallest value that satisfies a monotonic feasibility check.
- Tree DFSRecursive depth-first traversal that combines results from subtrees.
- Graph BFS & Shortest PathsBreadth-first search for shortest paths in unweighted graphs and grids.
- Union-FindDisjoint sets with path compression to merge groups and query connectivity.
- Topological SortOrder a DAG so every edge points forward; detect cycles in dependencies.
- Heap: Top-KKeep the k best items with a bounded heap.
- 1-D Dynamic ProgrammingState depends on a single index: climbing stairs, house robber, decode ways.
- Subsets & CombinationsEnumerate choose/skip decisions to build subsets and combinations.
56 patterns across 15 areas, from complexity analysis to graphs and dynamic programming. Browse all lessons
Questions
Your next problem is waiting
Take the free 12-minute readiness check to see where you stand, then practise exactly what you’re missing.
Check your readiness, free