Complete search: enumerating candidate solutions · 1 of 3
Complete search technique
Recognise a complete search, write one over every pair, and count its candidates against the time limit before writing code.
0 of 8 solved
Difficulty: how hard each problem is if its topic is new to you.
- Very EasyRelated to the lesson, but quick to solve even before reading it.
- EasyQuick once you know the topic; approachable right after the lesson.
- NormalNeeds a bit more thinking.
- HardCan take a long time to find the approach.
- Very HardChallenges strong solvers; often needs several observations beyond the lesson.
- InsaneHarder than a reasonable contest at this level would ask; leave it for later.
