CANDY SEPARATION

CodeChefOpen on judge ↗

Problem description. Goku and Bulma both have a candy bar which is rectangular in shape and the candies are labeled as T, D and U. They want to split the bar into exactly two pieces such that: - Goku's piece is devoid of any candy labeled D and similarly, Bulma's piece can not contain any candy labeled T and U can be used by either of the two. - All candies in each piece must be connected (two

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