[Solution] Array sorting CodeChef Solution | Codechef Solution

[Solution] Array sorting CodeChef Solution | Codechef Solution 2022

You are given an unsorted permutation P$P$ of size N$N$. An operation is defined as:

• Swap Pi$P_i$ and Pi+K$P_{i+K}$ for any i$i$ in the range [1,N−K]$[1,N-K]$.

Find the maximum value of K$K$, such that, the permutation P$P$ can be sorted by applying any finite number of operations.

Solution Click Below:-  👉CLICK HERE👈

👇👇👇👇👇

Note that, a permutation of size N$N$ contains all integers from 1$1$ to N$N$ exactly once.

Input Format

• The first line of input will contain a single integer T$T$, denoting the number of test cases.
• Each test case consists of two lines of input.
  • The first line of each test case contains an integer N$N$, the size of permutation.
  • The next line contains N$N$ integers describing the permutation P$P$.
• It is guaranteed that the given permutation is not sorted.

Counting Words CodeChef Solution

MATH1 Enrolment CodeChef Solution

Group Assignment CodeChef Solution

Army Training CodeChef Solution 

Sort the String CodeChef Solution

Prime Xor CodeChef Solution

Vowel Anxiety CodeChef Solution

Array sorting CodeChef Solution

Output Format

For each test case, output on a new line the maximum possible value of K$K$.

Constraints

• 1≤T≤105$1\le T\le {10}^5$
• 2≤N≤105$2\le N\le {10}^5$
• Sum of N$N$ over all test cases does not exceed