Maximum Square Area by Removing Fences From a Field at Atlassian

Medium49.4% acceptance

This problem has 62.5% frequency at Atlassian.

Problem Description

There is a large `(m - 1) x (n - 1)` rectangular field with corners at `(1, 1)` and `(m, n)` containing some horizontal and vertical fences given in arrays `hFences` and `vFences` respectively. Horizontal fences are from the coordinates `(hFences[i], 1)` to `(hFences[i], n)` and vertical fences are...

Read full problem and hints

Topics

Also asked at 2 companies


More Atlassian Questions

View all Atlassian questions