Given an m $ imes$ n binary matrix mat, return the length of the longest line of consecutive $1$’s in the matrix.

The line can be horizontal, vertical, diagonal, or anti diagonal.

Constraints:

• m == mat.length

• n == mat[i].length

• $1 \leq$ m, n $\leq 10^4$

• $1 \leq$ m * n $\leq 10^4$

• mat[i][j] is either $0$ or $1$.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.