Given a 2D matrix of characters, find the length of the longest path of consecutive characters (e.g., 'A' -> 'B' -> 'C') starting from a given character, moving in any of the 8 directions.
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.