no tags 

You will be given a 2-dimensional grid of letters. Find the length of the longest path of consecutive letters, starting at 'A'. Paths can step from one letter in the grid to any adjacent letter (horizontally, vertically, or diagonally).

For example, in the following grid, there are several paths from 'A' to 'D', but none from 'A' to 'E':


One such path is:



Each test case will start with a line contains two integers H, W the height and width of the grid respectively 1 <= H, W <= 50. Then H lines follow each of W uppercase letters only. Input terminates with H = 0 and W = 0.


For each test case print “Case C: X” without quotes where C is the case number starting with 1 and X is the solution.


Sample Input:
4 3
0 0

Sample Output:
Case 1: 4

hide comments
saurav52: 2017-08-13 09:27:12

used recursion :)

saurav114: 2017-07-30 19:56:06

Can not figure out an iterative solution though..

lucifer_398: 2017-07-22 19:22:59

simple DFS...dont forget the case when no 'A' is present!!

tusharuppal: 2017-06-18 11:22:10

just dfs with memo..otherwise tle. ;-)

anurag44: 2017-06-16 22:51:25

Simple DFS!!

tanijer: 2017-06-10 20:54:21

Don't forget to reset the values for different test Costed me 7 WA.Nice Question.

jaykay12: 2017-05-23 23:26:13

Use Recursion with memo. Take care of Output statement.
AC in 1 go. :)

rraj001: 2017-05-15 12:32:14

use DFS+memo :D

aditya9125: 2017-05-09 13:29:36

Used DP, nothing new.

rohit9934: 2017-05-07 09:08:23

See Number of islands problem GeeksforGeeks Before this(If you are new in 2D Matrix Graph Traversals Like me :p

Added by:Ali Arous
Time limit:0.458s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ASM64
Resource:FCIS Local Contest 2012