[Solution] First and Last CodeChef Solution | CodeChef Problem Solution 2022

[Solution] First and Last CodeChef Solution | CodeChef Problem Solution 2022

You are given an array A=[A1,A2,…,AN]$A=[A_1,A_2,\dots ,A_N]$ of length N$N$.

You can right rotate it any number of times (possibly, zero). What is the maximum value of A1+AN$A_1+A_N$ you can get?

Note: Right rotating the array [A1,A2,…,AN]$[A_1,A_2,\dots ,A_N]$ once gives the array [AN,A1,A2,…,AN−1]$[A_N,A_1,A_2,\dots ,A_{N-1}]$. For

Solution Click Below:-  CLICK HERE

example, right rotating [1,2,3]$[1,2,3]$ once gives [3,1,2]$[3,1,2]$, and right rotating it again gives [2,3,1]$[2,3,1]$.

Input Format

• The first line of input will contain a single integer T$T$, denoting the number of test cases. The description of the test cases follows.

Rating Improvement CodeChef Solution

Playlist CodeChef Solution

First and Last CodeChef Solution

Simple XOR CodeChef Solution

Break the Stick CodeChef Solution

The two numbers CodeChef Solution 

Split AND Sum CodeChef Solution

• The first line of each test case contains a single integer N$N$, denoting the length of array A$A$.
• The second line of each test case contains N$N$ space-separated integers A1,A2,…,AN$A_1,A_2,\dots ,A_N$ — denoting the array A$A$.

Output Format

For each test case, output on a new line the maximum value of A1+AN$A_1+A_N$ you can get after several right rotations.

Constraints

• 1≤T≤1000$1\le T\le 1000$
• 2≤N≤105$2\le N\le {10}^5$
• 1≤Ai≤109$1\le A_i\le {10}^9$
• The sum of N$N$ across all test cases does not exceed 105