Search
⌘K
Leetcode 587. Erect the Fence
Given a set of 2D points, compute the minimal-perimeter fence that encloses them and return all points that lie on the fence boundary. This is the convex-hull problem (n ≤ 3000) with the extra requirement to include collinear points along hull edges.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.