Leetcode Problem 1802. Maximum Value at a Given Index in a Bounded Array

Algorithm

1. Define a function getSum(index, value) that calculates the minimum sum of the array given nums[index] = value.
2. Initialize the binary search space with left = 1 and right = maxSum.
3. Perform binary search:
   • Calculate mid = (left + right + 1) // 2.
   • If getSum(index, mid) <= maxSum, set left = mid.
   • Otherwise, set right = mid - 1.
4. Return left as the maximum value for nums[index] after the binary search ends.