Algorithms quiz

Test your Algorithms knowledge with a free interactive quiz — 50 questions with answers and explanations. No signup needed to play.

The "sliding window" technique is most useful for:

1. The "sliding window" technique is most useful for:
2. Binary search has what time complexity, and what is its precondition?
3. The time-vs-space tradeoff means:
4. Iterative algorithms have which usual advantage over recursive ones (for the same problem)?
5. Quicksort's average vs worst-case time complexity is:
6. What is the time complexity of linear search on an unsorted array of n elements?
7. A recursive algorithm requires what to terminate?
8. What is an algorithm?
9. What is a loop invariant?
10. What does "in-place" mean for an algorithm?
11. When we say an algorithm is "correct", we mean:
12. Using a hash set/map to speed up lookups changes a "find pair" loop's complexity from:

More quizzes