← All problemsSign in

JOHNs KILLINGS

As $The$ $Brothers$ $of$ $Watch$ tries to kill $John$, He decides to punish these $N$ brothers with id $[1,2,3,...N]$ for their act. As being a person with a kind heart he decides to kill few from them based on a criteria. They are assigned with a character between $a$ to $z$ (both Inclusive). John kills the person with character having $least$ $ASCII$ value. If two persons have same character

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