Coloured boxes

CodeChefOpen on judge ↗

There are n coloured boxes on the table in a row, each of them can be red, green or blue. Count the minimum number of boxes to take from the table so that any two neighbouring boxes had different colors. Boxes in a row are considered neighbouring if there are no other boxes between them. ###Input The first line of input contains a single integer T : the number of test cases(1<=T<=15). The fir

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