Reach Ks (Keteki)

CodeChefOpen on judge ↗

Given a 2D grid, represented by a string array, a character in a row is occupied and cannot be entered if its a '#'. And is empty and can be entered if its a '.'. If a character is 'X', then you are currently present there. There will be some characters which are 'K'. Print "Yes", if its possible to reach all 'K's, else print "No". (All quotes for clarity and the characters in input are case sens

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