Help Ashutosh

CodeChefOpen on judge ↗

Ashutosh, a blind man recently bought N binary strings all of equal length .A binary string only contains '0's and '1's . The strings are numbered from 1 to N and all are distinct, but Ashutosh can only differentiate between these strings by touching them. In one touch Ashutosh can identify one character at a position of a string from the set. Find the minimum number of touches T Ashutosh has to m

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