← All problemsSign in

Rajeev and Beautiful Row

There are N students in a row, some Student are facing right and some left. Rajeev thinks the row will look good if all the students will face in the same direction. In one step you can move any one segment of consecutive Students. After moving a segment, all students facing right will face toward left and vice versa In how many minimum number of steps students will face in the same direction?

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