# Word Search - l

Moderate
0/80
Average time to solve is 30m
Contributed by

## Problem statement

You are given a 2D board('N' rows and 'M' columns) of characters and a string 'word'.

Your task is to return true if the given word exists in the grid, else return false. The word can be constructed from letters of sequentially adjacent cells, where adjacent cells are horizontally or vertically neighboring.

Note:
``````The same letter cell should not be used more than once.
``````
For Example:
``````For a given word “design” and the given 2D board
[[q’, ‘v’, ‘m’, ‘h’],
[‘d’, ‘e’, ‘s’, ‘i’],
[‘d’, ‘g’, ‘f’, ‘g’],
[‘e’, ‘c’, ‘p’, ‘n’]]

The word design can be formed by sequentially adjacent cells as shown by the highlighted color in the 2nd row and last column.
``````

Detailed explanation ( Input/output format, Notes, Images )
##### Sample Input 1:
``````coding
4 4
c z k l
o d i a
r g n m
m r s d
``````
##### Sample Output 1:
``````true
``````
##### Explanation For Sample Input 1:
``````For the given word, and grid we can construct from letters of sequentially adjacent cells as shown below:
``````

##### Sample Input 2:
``````ninjas
4 4
c d k s
o d s i
d g n j
e r i n
``````
##### Sample Output 2:
``````false
``````
##### Constraints:
``````1 <= N <= 6
1 <= M <= 6
1 <= |word| <=20

Time Limit: 1 sec
``````
Console