Congratulations, you’ve finished the course! You practiced hashing, two pointers, and sliding windows, then chose between them yourself in the mixed exercises and a mock interview. Now pick one problem where you needed a hint or peeked at the solution. Close your earlier code and give it another spin with a fresh example.
Before you run the tests, explain why your approach keeps the information it needs. Then account for the work and extra storage, including Python operations such as slicing or sorting. If your first idea changed along the way, describe what repeated work you removed.
Next, try changing one constraint. You could drop the sorted-input guarantee, allow negative values in a window problem, or require the input to stay unchanged. Walk a small example through by hand and see whether your reasoning still holds.
When you’re ready for more, continue with the next course in the Coding Interview Practice learning path:
Course
Python Coding Interview Practice: Prefix Sums and Binary Search
Practice prefix sums and binary search in Python through 14 coding interview exercises with tests, efficiency checks, hints, and code reviews.
