School Days
CodeChefOpen on judge ↗
Udit and Rohit are friends from childhood.It was the first time they came to learn about English alphabets i.e. - [A-Z]. That day their teacher gave them some homework. The homework was like this: All the students were given n strings. The students have to find all such pairs of strings whose combination contains all alphabets from A-Z. Since they are very small to do this on their own they th
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