Competitive quiz: 24 questions
24 questions from the 8 lessons of Competitive Programming. Each answer is explained, with a link back to the lesson it comes from, and your best score stays on this device.
Test yourself
24 questions from this course's lessons, in a random order. See what you remember, then go back to the lessons behind the questions you missed.
What the quiz covers
- Contests, judges and time limits (3 questions)
- Prefix sums (3 questions)
- Two pointers and sliding windows (3 questions)
- Binary search on the answer (3 questions)
- Sorting first, then greedy (3 questions)
- Dynamic programming in contests (3 questions)
- Graphs with the STL (3 questions)
- Math for contests (3 questions)