Most of the script is already written. You type the missing part, run it, and the next one hides a little more.
Topics in the order most people learn them, following the NeetCode roadmap. Tap one to jump to its drills. Dashed topics are coming soon.
Core: enough for a practical coding screen. Stretch: SWE intermediate. Deep SWE: skip unless the role is software engineering. Dimmed topics are outside your filter.
Patterns you looked up, most often first. Each one comes with a link to the Python docs.
Every pattern in the app, by topic.
The follow-up almost every interviewer asks: how does it scale as the input grows?
O(1) one step: dict lookup, list.append, an index O(log n) halving: binary search O(n) one pass: a loop, sum(), max(), x in a list O(n log n) sorting: sorted(), list.sort() O(n²) a loop inside a loop over the same data O(2ⁿ) trying every combination: naive recursion
x in a list O(n) x in a set or dict O(1) list.pop(0) O(n) use deque.popleft(), which is O(1) s[a:b] O(b - a), a slice makes a copy sorted(x) O(n log n)
"One pass over the input, and each dict lookup is O(1), so time is O(n). The dict can hold n items, so space is O(n)."
Name time and space. Then say what the brute force would cost, for example O(n²) with two loops, and what you traded to beat it.
A real Python prompt. Tap a command or type your own, like dir(str) or help(str.split).