#1089Medium#35 in Infosys's list· asked at 5 companies
Maximum Sum Circular Subarray
Hosted on LeetCode
Solve it on LeetCode, track it here.
This problem's full statement lives on LeetCode. Open it in a new tab, then come back to mark it solved, add notes and keep your streak.
LeetCode Premium locked?
Most company-tagged LeetCode problems are behind Premium. If you have ChatGPT Plus or Claude Pro, ask it for the full statement, examples and constraints. The buttons below open a chat with the prompt already filled in.
What we know
Example 1
Input: nums = [1,-2,3,-2] Output: 3
Example 2
Input: nums = [5,-3,5] Output: 10
Wrap around: 5 + 5.
Example 3
Input: nums = [-3,-2,-3] Output: -2
Constraints
- •
n == nums.length - •
1 <= n <= 3 * 10^4 - •
-3 * 10^4 <= nums[i] <= 3 * 10^4