MEX

CodeChefOpen on judge ↗

You are given an array A containing N integers. Find the number of subsequences S in A such that, it satisfies two of the following conditions. - MEX(S) $\neq$ L - 1 - MEX(S) $\neq$ L + 1 Where L is the last element of S. ### Input - The first line of input will contain a single integer $T$, denoting the number of test cases. - Each test case consists of multiple lines of input. - The first l

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI