Avoiding M (Easy)
**This is the easy version of the problem. Here $N, M \le 3000$.** You are given $2$ integers $N$ and $M$. An array $A$ of length $N$ is called good if the following conditions are satisfied: - $0 \le A_i \le N$ - There does not exist a subarray with mex $M$. - More formally, there should not be integers $L$ and $R$ such that $1 \le L \le R \le N$, and $\text{MEX}(A[L, R]) = M$. Count the num
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.
Sign in to chat with the tutor and save your progress.
Sign in to start