**Problem Description**

Given an integer array **A** of size **N**.

You can pick **B** elements from either left or right end of the array **A** to get maximum sum.

Find and return this **maximum possible sum**.

**NOTE:** Suppose B = 4 and array A contains 10 elements then:

1 <= N <= 10^{5}

1 <= B <= N

-10^{3} <= A[i] <= 10^{3}

First argument is an integer array **A**.

Second argument is an integer **B**.

Return an integer denoting the maximum possible sum of elements you picked.

Input 1:

A = [5, -2, 3 , 1, 2] B = 3

Input 2:

A = [1, 2] B = 1

Output 1:

8

Output 2:

2

Explanation 1:

Pick element 5 from front and element (1, 2) from back so we get 5 + 1 + 2 = 8

Explanation 2:

Pick element 2 from end as this is the maximum we can get

NOTE:You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified. Still have a doubt? Checkout Sample Codes for more details.

- Hint 1
- Solution Approach
- Complete Solution

Loading...