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.

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 587. Erect the Fence

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact