Word Find(keteki)

CodeChefOpen on judge ↗

Given a list of names L, and a 2D grid of characters. Find the number of names of L found in the 2D grid of characters. The characters in the grid can be read from top to down, down to top, left to right, right to left and diagonally(diagonally in all 4 directions NW to SE, SE to NW, NE to SW and SW to NE). Print the number of names found in the grid. Note: If the same name is found more than on

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