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
Aditya Kumar: 2015-12-18 06:38:14

really nice question--- Implemented BFS.
@dhruv_iitj: - AABCD the answer is 4 [ABCD]
for ABBCD it is 2 [AB].

It is self- explanatory in the question.

dhruv_iitj: 2015-12-14 06:23:48

can the answer be AABCD... that is, can we have redundancy of letters??

Prateek Agarwal: 2015-12-03 12:25:15

had to use memoization to get AC.

arjun: 2015-11-24 23:04:38

getting tle using dfs...any suggestions

arjun: 2015-11-24 21:54:43

getting wa..cant think of any oter corner cases...need help..thanks

Last edit: 2015-11-24 21:55:55
sathya_dev: 2015-11-23 14:53:47

For those getting WA. A Path has to start from 'A' and sequence of consecutive letters (not just any sequence of consecutive letters.
BCD & AB the op = 2 not 3.

varun yadav: 2015-11-05 09:48:00

finally accepted :p

Himanshu Bansal: 2015-10-31 14:53:00

nice question

dev: 2015-10-19 13:26:48

FIRST dfs prob !! Ac :)

topke: 2015-10-08 10:29:54

This is easy i don't know why it has 20% success rate :D

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