Permutation Clear

CodeChefRating 1308Open on judge ↗

Alice has an array $A$ of length $N$ which is initially a *permutation*. She dislikes $K$ numbers which are $B_1, B_2, \ldots, B_K$ all of which are **distinct**. Therefore, she removes all the occurrences of these numbers from $A$. The order of the remaining elements of the $A$ does **not** change. Can you find out the resulting array $A$? Note: A *permutation* of length $N$ is an array where

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