DSA Visualizations | Hello Interview

Maximal Square

DESCRIPTION (credit Leetcode.com)

Given an m x n 2D matrix with only 0's and 1's, write a function to return the area of the largest square containing only 1's.

EXAMPLES

Input:


matrix = [
[0, 0, 1, 0, 0],
[1, 1, 1, 0, 1],
[0, 1, 1, 0, 0]
]

Output:

Run your code to see results here

Explanation

The solution uses bottom-up dynamic programming to solve the problem. The solution is based on the observation that the size of the largest square ending (bottom-right corner) at a particular cell is equal to the minimum of the sizes of the largest squares ending at the three adjacent cells plus 1.

We create a 2D integer array dp of size (r + 1) x (c + 1) where r is the number of rows in the input array and c is the size of each row. dp[i][j] stores the side length of the largest square ending at the cell matrix[i - 1][j - 1]. All elements of dp are initialized to 0.


def maximal_square(matrix):
  if not matrix:
    return 0

  r = len(matrix)
  c = len(matrix[0])
  dp = [[0] * (c + 1) for _ in range(r + 1)]
  max_side = 0

  for i in range(1, r + 1):
    for j in range(1, c + 1):
      if matrix[i - 1][j - 1] == 1:
        top = dp[i - 1][j]
        left = dp[i][j - 1]
        diag = dp[i - 1][j - 1]
        dp[i][j] = min(top, left, diag) + 1
        max_side = max(max_side, dp[i][j])

  return max_side * max_side

maximal square

0 / 1

We then use a nested loop to iterate over the input array. For each cell matrix[i - 1][j - 1], we check if the cell contains a 1. If it does, we update dp[i][j] to the minimum of the sizes of the largest squares ending at the three adjacent cells plus 1. We also update a variable max_side to store the maximum side length of the largest square we have found so far.


def maximal_square(matrix):
  if not matrix:
    return 0

  r = len(matrix)
  c = len(matrix[0])
  dp = [[0] * (c + 1) for _ in range(r + 1)]
  max_side = 0

  for i in range(1, r + 1):
    for j in range(1, c + 1):
      if matrix[i - 1][j - 1] == 1:
        top = dp[i - 1][j]
        left = dp[i][j - 1]
        diag = dp[i - 1][j - 1]
        dp[i][j] = min(top, left, diag) + 1
        max_side = max(max_side, dp[i][j])

  return max_side * max_side

i = 1 | j = 1

0 / 2

Calculating size of the maximal square when matrix[i - 1][j - 1] = 1


def maximal_square(matrix):
  if not matrix:
    return 0

  r = len(matrix)
  c = len(matrix[0])
  dp = [[0] * (c + 1) for _ in range(r + 1)]
  max_side = 0

  for i in range(1, r + 1):
    for j in range(1, c + 1):
      if matrix[i - 1][j - 1] == 1:
        top = dp[i - 1][j]
        left = dp[i][j - 1]
        diag = dp[i - 1][j - 1]
        dp[i][j] = min(top, left, diag) + 1
        max_side = max(max_side, dp[i][j])

  return max_side * max_side

i = 3 | j = 4

0 / 2

Another maximal square calculation when matrix[i - 1][j - 1] = 1

At the end of the loop, max_side contains the side length of the largest square containing only 1's in the input array. The area of the square is max_side * max_side.

Solution


def maximal_square(matrix):
  if not matrix:
    return 0

  r = len(matrix)
  c = len(matrix[0])
  dp = [[0] * (c + 1) for _ in range(r + 1)]
  max_side = 0

  for i in range(1, r + 1):
    for j in range(1, c + 1):
      if matrix[i - 1][j - 1] == 1:
        top = dp[i - 1][j]
        left = dp[i][j - 1]
        diag = dp[i - 1][j - 1]
        dp[i][j] = min(top, left, diag) + 1
        max_side = max(max_side, dp[i][j])

  return max_side * max_side

maximal square

0 / 48

Complexity Analysis

Time Complexity: We iterate over each cell of the input array once, and for each cell, we perform a constant amount of work. Therefore, the time complexity is O(m * n) where m is the number of rows in the input array and n is the length of each row. Space Complexity: We use a 2D array dp of size (m + 1) x (n + 1) to store the side length of the largest square ending at each cell. Therefore, the space complexity is O(m * n).

Next: Unique Paths

Your account is free and you can post anonymously if you choose.

Loading comments...

Back to Home

Eliminating Pairs

Overview

Container With Most Water

3-Sum

Triangle Numbers

Pointers as Regions

Move Zeroes

Sort Colors

Trapping Rain Water

Variable-Length

Overview

Longest Substring Without Repeating Characters

Longest Repeating Character Replacement

Fixed-Length

Overview

Maximum Sum of Subarrays of Size K

Max Points You Can Obtain From Cards

Max Sum of Distinct Subarrays Length k

Overview

Can Attend Meetings

Insert Interval

Non-Overlapping Intervals

Merge Intervals

Employee Free Time

Overview

Valid Parentheses

Decode String

Longest Valid Parentheses

Monotonic Stack

Overview

Daily Temperatures

Largest Rectangle in Histogram

Overview

Linked List Cycle

Palindrome Linked List

Remove Nth Node From End of List

Reorder List

Swap Nodes in Pairs

Overview

Apple Harvest (Koko Eating Bananas)

Search in Rotated Sorted Array

Overview

Kth Largest Element in an Array

K Closest Points to Origin

Find K Closest Elements

Merge K Sorted Lists

Introduction

Binary Trees

Overview

Level Order Sum

Rightmost Node

Zigzag Level Order

Maximum Width of Binary Tree

Graphs

Overview

Minimum Knight Moves

Rotting Oranges

01-Matrix

Bus Routes

Overview

Word Search

Solution Space Trees

Subsets

Generate Parentheses

Combination Sum

Topological Sort

Overview

Course Schedule

Course Schedule II

Fundamentals

Solving a Question with Dynamic Programming

Counting Bits

Decode Ways

Maximal Square

Unique Paths

Longest Increasing Subsequence

Word Break

Maximum Profit in Job Scheduling

Overview

Best Time to Buy and Sell Stock

Gas Station

Jump Game

Overview

Implement Trie Methods

Prefix Matching

Overview

Count Vowels in Substrings

Subarray Sum Equals K

Spiral Matrix

Rotate Image

Set Matrix Zeroes

Decode Ways

Unique Paths

Maximal Square

DESCRIPTION (credit Leetcode.com)

Given an m x n 2D matrix with only 0's and 1's, write a function to return the area of the largest square containing only 1's.

EXAMPLES

Input:


matrix = [
[0, 0, 1, 0, 0],
[1, 1, 1, 0, 1],
[0, 1, 1, 0, 0]
]

Output:

Run your code to see results here

Explanation


def maximal_square(matrix):
  if not matrix:
    return 0

  r = len(matrix)
  c = len(matrix[0])
  dp = [[0] * (c + 1) for _ in range(r + 1)]
  max_side = 0

  for i in range(1, r + 1):
    for j in range(1, c + 1):
      if matrix[i - 1][j - 1] == 1:
        top = dp[i - 1][j]
        left = dp[i][j - 1]
        diag = dp[i - 1][j - 1]
        dp[i][j] = min(top, left, diag) + 1
        max_side = max(max_side, dp[i][j])

  return max_side * max_side

maximal square

0 / 1


def maximal_square(matrix):
  if not matrix:
    return 0

  r = len(matrix)
  c = len(matrix[0])
  dp = [[0] * (c + 1) for _ in range(r + 1)]
  max_side = 0

  for i in range(1, r + 1):
    for j in range(1, c + 1):
      if matrix[i - 1][j - 1] == 1:
        top = dp[i - 1][j]
        left = dp[i][j - 1]
        diag = dp[i - 1][j - 1]
        dp[i][j] = min(top, left, diag) + 1
        max_side = max(max_side, dp[i][j])

  return max_side * max_side

i = 1 | j = 1

0 / 2

Calculating size of the maximal square when matrix[i - 1][j - 1] = 1


def maximal_square(matrix):
  if not matrix:
    return 0

  r = len(matrix)
  c = len(matrix[0])
  dp = [[0] * (c + 1) for _ in range(r + 1)]
  max_side = 0

  for i in range(1, r + 1):
    for j in range(1, c + 1):
      if matrix[i - 1][j - 1] == 1:
        top = dp[i - 1][j]
        left = dp[i][j - 1]
        diag = dp[i - 1][j - 1]
        dp[i][j] = min(top, left, diag) + 1
        max_side = max(max_side, dp[i][j])

  return max_side * max_side

i = 3 | j = 4

0 / 2

Another maximal square calculation when matrix[i - 1][j - 1] = 1

At the end of the loop, max_side contains the side length of the largest square containing only 1's in the input array. The area of the square is max_side * max_side.

Solution


def maximal_square(matrix):
  if not matrix:
    return 0

  r = len(matrix)
  c = len(matrix[0])
  dp = [[0] * (c + 1) for _ in range(r + 1)]
  max_side = 0

  for i in range(1, r + 1):
    for j in range(1, c + 1):
      if matrix[i - 1][j - 1] == 1:
        top = dp[i - 1][j]
        left = dp[i][j - 1]
        diag = dp[i - 1][j - 1]
        dp[i][j] = min(top, left, diag) + 1
        max_side = max(max_side, dp[i][j])

  return max_side * max_side

maximal square

0 / 48

Complexity Analysis

Next: Unique Paths

Your account is free and you can post anonymously if you choose.

Loading comments...

BlogBehavioral Interview Examples Interviewing for Experienced SWEs All Blog Posts

Compare UsCompare to Interviewing.io

LinksFAQ Schedule Mock Interviews Pricing Become a Coach Our Coaches Learn System Design Learn DSA

LegalTerms and Conditions Privacy Policy

Contactsupport@hellointerview.com7511 Greenwood Ave North
Unit #4238 Seattle, WA 98103