Maximum Sum Circular Subarray Problem Statement

Find the maximum possible sum of a non-empty subarray from a given circular array/list ARR containing N integers.

Explanation:

The array is circular, meaning the end of the list connects back to the beginning. A circular subarray may only include each element once.

Input:

The first line contains an integer 'T' indicating the number of test cases.
For each test case:
The first line contains an integer 'N', the number of elements in the array 'ARR'.
The second line contains 'N' space-separated integers representing the array 'ARR'.

Output:

Print the maximum possible sum of a non-empty subarray of 'ARR' for each test case, one per line.

Example:

Input:
ARR = [1, 2, -3, -4, 5]
Output:
8

Explanation: The subarray [5, 1, 2] forms the maximum sum of 8, as the array is circular.

Constraints:

• 1 ≤ T ≤ 100
• 1 ≤ N ≤ 10⁵
• -10⁵ ≤ ARR[i] ≤ 10⁵
• Time Limit: 1 sec

Note:

The output for each test case continues automatically. You just need to implement the function.