Busy Teacher

CodeChefOpen on judge ↗

Today, Gojo sensei had to teach the students at Junior High! Unfortunately, He has to leave for an unexpected expedition, you have been tasked to help Gojo save his time. You are given a two-dimensional list of strings `subjects` of length $N$, where `subjects[i]` is a list of subjects that the $i^{th}$ student likes, $\forall_i$ such that $0 \leq i \lt N$. Find the **minimum** size of such a li

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