← All problemsSign in

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

LeetCodeMathBinary SearchGreedyOpen on judge ↗

You are given three positive integers: n, index, and maxSum. You want to construct an array nums (0-indexed) that satisfies the following conditions: - nums.length == n - nums[i] is a positive integer where 0 <= i < n. - abs(nums[i] - nums[i+1]) <= 1 where 0 <= i < n-1. - The sum of all the elements of nums does not exceed maxSum. - nums[index] is maximized. Return nums[index] of the constru

HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI

Sign in to chat with the tutor and save your progress.

Sign in to start