Geeksforgeeks

Error

×

Leaderboard

Showing:

Handle | Score |
---|---|

@Ibrahim Nash | 6379 |

@blackshadows | 6329 |

@mb1973 | 5376 |

@Quandray | 5231 |

@akhayrutdinov | 5111 |

@saiujwal13083 | 4510 |

@sanjay05 | 3762 |

@marius_valentin_dragoi | 3522 |

@sushant_a | 3459 |

@verma_ji | 3357 |

@KshamaGupta | 3318 |

Complete Leaderboard | |

Handle | Score |

@184025 | 108 |

@terabaap123 | 95 |

@arshjit_singh7 | 92 |

@anamikaprasad124 | 92 |

@kumsachin10 | 90 |

@vaibhavinayak | 75 |

@TanmayJ | 74 |

@NullPointerException | 74 |

@ronaldo77 | 72 |

@ritiksethi21 | 68 |

@bhupindersingh25122001 | 68 |

Complete Leaderboard |

Given a 2D grid (G[]) of characters and a word(x), find all occurrences of given word in grid. A word can be matched in all 8 directions at any point. Word is said be found in a direction if all characters match in this direction (not in zig-zag form).

The 8 directions are, Horizontally Left, Horizontally Right, Vertically Up, Vertically down and 4 Diagonal directions.

Example:

```
Input: G[][] = {"GEEKSFORGEEKS",
"GEEKSQUIZGEEK",
"IDEQAPRACTICE"};
x = "GEEKS"
Output: pattern found at 0, 0
pattern found at 0, 8
pattern found at 1, 0
```

**Input:**

The first line of input contains an integer T denoting the no of test cases. Then T test cases follow. Each test case contains two space separated integers N and M denoting the size of the grid. Then in the next line are N * M space separated values of the grid. In the next line is the word x.

**Output:**

For each test case in a new line print the space separated sorted indexes of the matrix where after each index there is a ', ' . If there are no such occurences print -1.

**Constraints:**

1<=T<100

1<=N,M<=100

1<=G[]<=100

**Example:
Input:**

2

3 3

a b c d e f g h i

abc

4 3

a b a b a b e b e b e b

abe

0 0,

0 0, 0 2, 1 1,

Login to report an issue on this page.

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

Yes
Find the string in grid

...