Friends pairing problem

Friends pairing problem is a DSA topic. In plain words you use it for a short Friends pairing problem example in a short dry-run on paper. Don’t start with a slogan — start with that picture.

Smallest example: the smallest Friends pairing problem example you can type. Type it, run it, and say what you see. If you can do that from memory, you know Friends pairing problem.

From the example next to this theory — Friends pairing problem: dry-run [4, 1, 3].

Trap — only saying “Friends pairing problem” with no example. Fix that before you talk about advanced DSA.

Viva: what is Friends pairing problem? Then show the smallest Friends pairing problem example you can type. Then name the trap.