Geeksforgeeks

X

DAYS

:

HOUR

:

MINS

:

SEC

Error

Copied to Clipboard

Given an array **arr[]** of **N** integers arranged in a **circular** fashion. Your task is to find the **maximum contiguous subarray sum**.

**Example 1:**

Input:N = 7 arr[] = {8,-8,9,-9,10,-11,12}Output:22Explanation:Starting from the last element of the array, i.e, 12, and moving in a circular fashion, we have max subarray as 12, 8, -8, 9, -9, 10, which gives maximum sum as 22.

**Example 2:**

**Input:
**N = 8
arr[] = {10,-3,-4,7,6,5,-4,-1}
**Output:
**23**
Explanation: **Sum of the circular
subarray with maximum sum is 23

**Your Task:**

The task is to complete the function **circularSubarraySum**() which returns a sum of the circular subarray with maximum sum.

**Expected Time Complexity: **O(N).

**Expected Auxiliary Space: **O(1).

**Constraints:**

1 <= N <= 10^{6}

-10^{6 }<= Arr[i] <= 10^{6}

We are replacing the old Disqus forum with the new Discussions section given below.

Click here to view old Disqus comments.

Click here to view old Disqus comments.

Login to report an issue on this page.

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

YesLoading...

Max Circular Subarray Sum

...