Practice Maximum Sum Circular Subarray
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Maximum Sum Circular Subarray
Problem Statement
Given a circular integer array nums of length n, return the maximum possible sum of a non-empty subarray of nums. A circular array means the end of the array connects to the beginning of the array. Formally, the next element of nums[i] is nums[(i + 1) % n] and the previous element of nums[i] is nums[(i - 1 + n) % n]. A subarray may only include each element of the fixed buffer nums at most once. Formally, for a subarray nums[i], nums[i + 1], ..., nums[j], there does not exist i <= k1, k2 <= j with k1 % n == k2 % n.
Source: Maximum Sum Circular Subarray on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
nums = [1,-2,3,-2]
3
# Example 2
nums = [5,-3,5]
10
# Example 3
nums = [-3,-2,-3]
-2
Constraints
Related LeetCode Problems
Practice more problems similar to Maximum Sum Circular Subarray.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.