Final Quiz
Test everything.
Time to test everything you've learned. For each question, pause the video, choose your answer, and then listen.

- Test everything
- Pause and choose
- Then listen
Question 1
What does O of log N usually mean? The answer is, the problem is cut in half each step, like binary search.
Question 2
You need to check, have I seen this before, many times. What should you use? The answer is a set, with O of one lookups.
Question 3
Which structure gives you the smallest item fastest, again and again? The answer is a heap.
Question 4
What's the longest substring without repeats a classic use of? The answer is the sliding window.
Question 5
A problem asks for the number of ways to reach the top, and smaller answers repeat. What technique fits? The answer is dynamic programming.
Summary
Well done for finishing the final quiz. Next, how to keep practising after this course.
Key takeaways- Halving is log n
- Sets for seen before
- Heaps, windows, DP