[Solution] Subarrays with length CodeChef Solution | CodeChef Problem Solution 2022

[Solution] Subarrays with length CodeChef Solution | CodeChef Problem Solution 2022

You are given an array A$A$ of length N$N$.

Determine the count of subarrays of A$A$ which contain their length as an element.

Formally, count the number of pairs (L,R)$(L,R)$ (1≤L≤R≤N)$(1\le L\le R\le N)$ such that: (R−L+1)∈{AL,AL+1,…,AR}$(R-L+1)\in \{A_L,A_{L+1},\dots ,A_R\}$.

Solution Click Below:-  CLICK HERE

Input Format

• First line will contain T$T$, number of test cases. Then the test cases follow.

Xor Palindrome CodeChef Solution

Total Prize Money CodeChef Solution

Subsequence-Numbers Divisible by 7 CodeChef Solution

Subarrays with length CodeChef Solution

Practice makes us perfect CodeChef Solution

Score High CodeChef Solution

Make them Zero CodeChef Solution

Degree of Polynomial CodeChef Solution

• First line of each test case contains an integer N$N$ denoting the length of the array A$A$.
• 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 the count of subarrays containing their lengths.

Constraints

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