Position: SDE2 https://leetcode.com/problems/maximal-rectangle/ Solutions discussed: ``` // 1. Brute force // Time complexity : O(N^3M^3) // Space complexity : O(1)O(1). ``` he asked me to improve my solution. I said i can improve on the...

LeetCode Question · Apr 2020 · Los Angeles

Microsoft | Onsite | Maximal Rectangle

SWE Onsite

9 upvotes 3,366 views 3 replies

Position: SDE2 <details> <summary>Solutions discussed:</summary> he asked me to improve my solution. I said i can improve on the...

🔒

Unlock full leaked content

Full insider details, leaked discussions, and candidate experiences.

Arrays Matrix Stack