Cyclic Maximum Subarray Sum

Problem Statement

You are given an array a of length n . You can do the following operation on a any number of times. Delete the first element in a and append that element to the end of a . Find the maximum subarray sum that can be obtained . Note: It is guaranteed that the answer fits in a 32 bit integer. Function description Complete the get_ans function in the editor below. It has the following parameter(s): Name Type Description n INTEGER The size of array a. a INTEGER ARRAY The given array. Return The function must return an INTEGER denoting the maximum subarray sum that can be obtained. Constraints 1 ≤ n ≤ 10 5 -10 5 ≤ a[i] ≤ 10 5 Input format for debugging The first line contains an integer, n, denoting the number of elements in a. Each line i of the n subsequent lines (where 0 ≤ i < n) contains an integer describing a[i]. Sample Testcases Input Output Output Description 1 -1 0 Here, n = 1 a = [-1] Choose an empty subarray. Hence, maximum subarray sum is 0. 3 1 -1 4 5 Here, n =