Deepak and Deep Confused in a chocolate

CodeChefOpen on judge ↗

Deepak and Deep have a rectangular-shaped chocolate bar with chocolates labeled T, D, and U. They want to split the bar into exactly two pieces such that: Deepak's piece can not contain any chocolate labeled D and similarly, Deep's piece can not contain any chocolate labeled T and U can be used by either of the two. All chocolates in each piece must be connected (two chocolates are connected i

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