Practice Largest Plus Sign

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Medium#764

LeetCode Problem

Largest Plus Sign

Array Dynamic Programming

Problem Statement

You are given an integer n. You have an n x n binary grid grid with all values initially 1's except for some indices given in the array mines. The ith element of the array mines is defined as mines[i] = [xi, yi] where grid[xi][yi] == 0. Return the order of the largest axis-aligned plus sign of 1's contained in grid. If there is none, return 0. An axis-aligned plus sign of 1's of order k has some center grid[r][c] == 1 along with four arms of length k - 1 going up, down, left, and right, and made of 1's. Note that there could be 0's or 1's beyond the arms of the plus sign, only the relevant area of the plus sign is checked for 1's.

Source: Largest Plus Sign on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input

n = 5, mines = [[4,2]]

Output

# Example 2

Input

n = 1, mines = [[0,0]]

Output

Constraints

1 <= n <= 500

1 <= mines.length <= 5000

0 <= xi, yi < n

All the pairs (xi, yi) are unique.

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.

Start Free