GO Solution For UVa 10010 - Where's Waldorf?. In this post we will see how we can solve this challenge in GoLang for UVa Online Judge.

Problem Description

Given a m by n grid of letters, (1 ≤ m,n ≤ 50), and a list of words, find the location in the grid at which the word can be found.

A word matches a straight, uninterrupted line of letters in the grid. A word can match the letters in the grid regardless of case (i.e. upper and lower case letters are

...

You can find the full details of the problem Where's Waldorf? at UVa Online Judge

Sample Input

1

8 11
abcDEFGhigg
hEbkWalDork
FtyAwaldORm
FtsimrLqsrc
byoArBeDeyv
Klcbqwikomk
strEBGadhrb
yUiqlxcnBjf
4
Waldorf
Bambi
Betty
Dagbert

Sample Output

2 5
2 3
1 2
7 8

Solution: Please check the main.go snippet for the solution.

Solution originally posted at: Github by @codingsince1985