Binary search · 2 of 3
Sorted arrays
Use the library's lower and upper bound for membership, counts and runs of equal values, then halve a rotated array and an array with peaks, which are not sorted.
0 of 10 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.
