# 16.01.2026 [2975. Maximum Square Area by Removing Fences From a Field] скачать в хорошем качестве

# 16.01.2026 [2975. Maximum Square Area by Removing Fences From a Field]

16.01.2026 [2975. Maximum Square Area by Removing Fences From a Field](https://leetcode.com/problems/maximum...) medium [blog post](https://leetcode.com/problems/maximum...) [substack](https://open.substack.com/pub/dmitrii...) [youtube](   • # 16.01.2026 [2975. Maximum Square Area by...  )  #### Join me on Telegram https://t.me/leetcode_daily_unstoppab... #### Problem TLDR Max square after remove vertical or horizontal bars #medium #### Intuition ```j // possible horizontal widths // intersect // possible vertical heights // // 1D problem: collect possible gaps // // |*****|**|*| // 5 2 1 // 1,2,5, 1+2, 2+5, 1+2+5 // |+1 -- all prev + x // 1+1,(1+2)+1,(1+2+5)+1 // max size is 600, so O(n^2) should be acceptable ``` Solve 1D problem. Find all possible gaps. Intersect. Pick max. #### Approach to find all gaps just use 2d for loop #### Complexity Time complexity: $$O(n^2)$$ Space complexity: $$O(n^2)$$ #### Code https://dmitrysamoylenko.com/2023/07/...