← All problemsSign in

Eligible Words

Chef has a bag full of words. Each word contains some lowercase and uppercase letters. Chef wants to find the $number$ $of$ $words$ $that$ $are$ $eligible$ $to$ $form$ $a$ $paragraph$. Eligible words are where $each$ $alphabet$ $in$ $the$ $word$ $is$ $present$ $atleast$ $once$ $in$ $it's$ $uppercase$ $as$ $well$ $as$ $lowercase$. Help Chef find the $number$ $of$ $eligible$ $words$.

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