Set 09
Binary Search — On Arrays and On the Answer
Seven problems, ramping from Very Easy to Extreme.
Progress · 0/7 solved
- VERY EASYQ1Binary Search Basic
- EASYQ2First and Last Occurrence
- MEDIUMQ3Square Root (integer floor)
- MEDIUM-HARDQ4Minimize the Maximum (Painter's Partition style)
- HARDQ5Kth Smallest Element in a Sorted Matrix (via binary search on value)
- VERY HARDQ6Aggressive Cows (Maximize Minimum Distance)
- EXTREMEQ7Median of Two Sorted Arrays in O(log(min(N,M)))