← All problemsSign in

Add a Bit

Loki was working with binary strings and he encountered an interesting problem. In Loki's world, binary strings are stored in reverse, i.e., the least significant bit is stored in the first character of the string, the next significant bit is stored in the second character, and so on; the most significant bit is stored in the last character. Let N be the number of bits in the binary string Loki

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