Grokking Meta Coding Interview

Hidden Document

## Problem Statement

Given a 2D matrix of size `m x n`, return the length of the `longest increasing path` in the matrix. The increasing path should have each element should be greater than the previous element in the path.

It is given that you can move only in 4-directions: `left`, `right`, `top`, and `bottom.`

### Examples

**Example 1:**
- **Input:** matrix = 
```
[[3, 4, 5], 
 [3, 2, 6], 
 [2, 2, 1]]
```
- **Expected Output:** `4`

- **Justification:** The longest increasing path is `3 -> 4 -> 5 -> 6`. No other path has a greater length.

**Example 2:**
- **Input:** matrix = 
```