Implement a function to find the longest path in a matrix where each cell has to be greater than the previous cell in the path

Hard

Problem Statement

Sample Input

matrix =
 [[9, 9, 4],
 [6, 6, 8],
 [2, 1, 1]]

Sample Output

Limits

Time: 2s · Memory: 256 MB

Code Editor

00:00

import java.util.*; public class Main { public static int longestPath() { int[][] matrix = { {9, 9, 4}, {6, 6, 8}, {2, 1, 1} }; // Your code here return 0; } }

Input

matrix =
 [[9, 9, 4],
 [6, 6, 8],
 [2, 1, 1]]

Expected Output

Custom Input (stdin)

Program Output

> Run your code to see console output.

Programming Exercises

Implement a function to find the longest path in a matrix where each cell has to be greater than the previous cell in the path

Problem Statement

Sample Input

Sample Output

Limits

Hint 1