[Solution] Minimum or Maximum CodeChef Solution | CodeChef Problem Solution 2022

[Solution] Minimum or Maximum CodeChef Solution | CodeChef Problem Solution 2022

From a hidden array A$A$ of length N$N$, Stack constructs an array B$B$ of length N$N$ such that:

• For all i$i$ (1≤i≤N)$(1\le i\le N)$, Bi=max(A1,A2,…,Ai)$B_i=max(A_1,A_2,\dots ,A_i)$ or Bi=min(A1,A2,…,Ai)$B_i=min(A_1,A_2,\dots ,A_i)$.

For the given array B$B$ of length N$N$, Stack wants you to check whether a possible array A$A$ exists or not.

Input Format

• The first line of input contains a single integer T$T$, denoting the number of test cases. The description of T$T$ test cases follow.

Solution Click Below:-  CLICK HERE

• The first line of each test case contains an integer N$N$ - the length of the array B$B$.
• The second line of each test case contains N$N$ space-separated integers B1,B2,…,BN$B_1,B_2,\dots ,B_N$ representing the array B$B$.

Output Format

For each test case, output in a single line YES if A$A$ exists, otherwise print NO.

Age Limit Codechef Solution

Equal Distribution Codechef Solution

Minimum number of Flips CodeChef Solution

Divisible by 3 CodeChef Solution

How Many Maximums CodeChef Solution

Minimum or Maximum CodeChef Solution 

Maximise Set Bits CodeChef Solution

Sorting Array CodeChef Solution

Construct An Array CodeChef Solution

You may print each character of the string in uppercase or lowercase (for example, the strings YES, yEs, yes, and yeS will all be treated as identical).

Constraints

• 1≤T≤105