Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

85. Maximal Rectangle #11

Open
F4NT0 opened this issue Apr 20, 2024 · 0 comments
Open

85. Maximal Rectangle #11

F4NT0 opened this issue Apr 20, 2024 · 0 comments
Assignees
@F4NT0
Labels
Hard Hard Questions Ready to code Description from the Question was updated with code and text
Milestone
April Leetcode

Comments

@F4NT0
Copy link
Owner

F4NT0 commented Apr 20, 2024 •
edited
Loading

Given a rows x cols binary matrix filled with 0's and 1's, find the largest rectangle containing only 1's and return its area.

Example 1:

image

  • Input: matrix = [["1","0","1","0","0"],["1","0","1","1","1"],["1","1","1","1","1"],["1","0","0","1","0"]]
  • Output: 6
  • Explanation: The maximal rectangle is shown in the above picture.

Example 2:

  • Input: matrix = [["0"]]
  • Output: 0

Example 3:

  • Input: matrix = [["1"]]
  • Output: 1

Constraints:

  • rows == matrix.length
  • cols == matrix[i].length
  • 1 <= row, cols <= 200
  • matrix[i][j] is '0' or '1'.
@F4NT0 F4NT0 added the Hard Hard Questions label Apr 20, 2024
@F4NT0 F4NT0 added this to the April Leetcode milestone Apr 20, 2024
@F4NT0 F4NT0 self-assigned this Apr 20, 2024
@F4NT0 F4NT0 added the Ready to code Description from the Question was updated with code and text label Apr 30, 2024
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees

@F4NT0 F4NT0

Labels
Hard Hard Questions Ready to code Description from the Question was updated with code and text
Projects
None yet
Milestone
April Leetcode
Development

No branches or pull requests
1 participant
@F4NT0