Grid Problem

CodeChefOpen on judge ↗

Grid Problem Pavel’s Friend’s house is in GBPIETLAND . Pavel wants to go to his friend's house but there is only one way to go there by Good park. Good park is a 2D park which consist of H horizontal rows and V vertical columns which has total H*V square and every square have one flower . Flower is of three types RGB “Red,Green,Blue”. While going through the path if Pavel encounters the Green

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