dsa1 min read
Split Array Largest Sum — Binary Search on Answer
Minimize the largest subarray sum when splitting into k parts using binary search on the possible answer range.
Read →
1575 articles
Minimize the largest subarray sum when splitting into k parts using binary search on the possible answer range.
Search in a rotated sorted array that may contain duplicates by skipping lo++ when mid equals both boundaries.
Find the minimum day to make m bouquets of k adjacent flowers using binary search on the day value.
Find h-index from a sorted citations array in O(log n) using left-boundary binary search.
Count spell-potion pairs with product >= success by sorting potions and binary searching for each spell's threshold.