← All problemsSign in

Prefix Suffix Distinct

CodeChefRating 2585Open on judge ↗

For an array $A$ of $N$ integers, define * An array $P$ of length $N$, where $P_i$ is the number of distinct elements in the subarray $A[1:i]$ of $A$. * An array $S$ of length $N$, where $S_i$ is the number of distinct elements in the subarray $A[i:N]$ of $A$. You are given arrays $P$ and $S$. Determine whether there exists an array $A$ corresponding to the given $P$ and $S$ arrays. ### Inp

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

Sign in to chat with the tutor and save your progress.

Sign in to start