Binary Search coding problems

Binary search goes far beyond finding a number in a sorted list: first and last positions, rotated arrays, and searching on the answer itself (minimum capacity, maximum distance). A favourite for medium interview rounds.

25 problems: 12 easy, 10 medium, 3 hard. Free to read; a free account solves them and earns XP and Aura.

  1. Count Elements Less Than KPractice · +10 XPeasy
  2. Count MultiplesPractice · +10 XPeasy
  3. Find Duplicate in Sorted ArrayPractice · +10 XPeasy
  4. Find Element in Sorted ArrayPractice · +10 XPeasy
  5. Find First Element Greater Than KPractice · +10 XPeasy
  6. Find First OccurrencePractice · +10 XPeasy
  7. Find Smallest Missing Positive IntegerPractice · +10 XPeasy
  8. Find Smallest Number Greater Than KPractice · +10 XPeasy
  9. First Element Greater Than Or Equal To KPractice · +10 XPeasy
  10. Nearest Element in Sorted ArrayPractice · +10 XPeasy
  11. Square Root Integer PartPractice · +10 XPeasy
  12. Sum of First N IntegersPractice · +10 XPeasy
  13. Maximize Minimum DifferencePractice · +20 XPmedium
  14. Maximum Average SubsegmentPractice · +20 XPmedium
  15. Maximum Sum of PairsPractice · +20 XPmedium
  16. Minimize Maximum DifferencePractice · +20 XPmedium
  17. Minimize Maximum Segment SumPractice · +20 XPmedium
  18. Minimum Cost to Make All EqualPractice · +20 XPmedium
  19. Minimum Maximum DifferencePractice · +20 XPmedium
  20. Minimum Maximum Height DifferencePractice · +20 XPmedium
  21. Optimal Apartment RentalPractice · +20 XPmedium
  22. Subarray Sum Closest to TargetPractice · +20 XPmedium
  23. Longest Non-Decreasing SubsequencePractice · +30 XPhard
  24. Minimize Maximum Difference of Grouped ElementsPractice · +30 XPhard
  25. Minimum Maximum SumPractice · +30 XPhard