Leetcode 1924. Erect the Fence II

Given a set of 2D points, compute the smallest convex polygon (fence) that encloses all points and return all points that lie on its boundary, including collinear and duplicate cases; this is a computational-geometry problem requiring a robust convex-hull algorithm that handles precision and edge cases efficiently.

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

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact