Beeds Arranging

CodeChefOpen on judge ↗

Beeds Arranging game is described by a string of length $n$ consisting of characters "." (empty space) and "*" (beed). In one move you can shift beed to one unit left or one unit right, only if the corresponding place $exists$ $and$ $is$ $empty$. The game ends up as soon as the beeds are lined up, that is, there should not exist any empty cells between any beeds. Jaskaran is finding this game a

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