Problem Statement
Maximum Length Path in Grid Problem Description You are given a grid of size n x m filled with integers. Starting from the top-left cell (0, 0) , you can move only right or down. You can move to a cell only if the next cell's value is strictly greater than the current cell's value. Find the maximum length of the path from (0, 0) to (n-1, m-1) . If it is not possible to reach (n-1, m-1) , return -1 .