Leetcode 85. Maximal Rectangle

Given a binary matrix, find the area of the largest axis-aligned rectangle containing only 1s. The key challenge is to efficiently compute this by treating each row as a histogram of consecutive 1s and using the largest-rectangle-in-histogram (monotonic stack) technique to achieve near O(rows·cols) time.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

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

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 85. Maximal Rectangle

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact