Solution

Method 1 – Dynamic Programming for All Directions (1)

Intuition

To find the longest line of consecutive ones in all four directions (horizontal, vertical, diagonal, anti-diagonal), we use dynamic programming to keep track of the length of consecutive ones ending at each cell for each direction.

Approach

Initialize a 3D dp array where dp[i][j][d] stores the length of consecutive ones ending at cell (i, j) in direction d (0: horizontal, 1: vertical, 2: diagonal, 3: anti-diagonal).
For each cell in the matrix:
- If the

Related Tags