Convex Hull — JavaScript Interview Practice

Convex Hull

Compute the smallest convex polygon enclosing a set of points.

Topics in the full lesson

Concept and Use Cases
Key Concepts
Time and Space Complexity
Convex Hull Algorithms and Methods
Practical Tips and Tricks
Common Gotchas
Advanced Topics
Interview Tips and Tricks
Common Mistakes

Practice Problems

Work through a question before revealing its explanation. These questions and answers are free; Premium adds the full lesson walkthrough, examples and implementation detail.

Completion marks record your own progress, not an automatically checked result. The task type does not determine whether it is optional.

CodingHard

Erect the Fence

Mark complete

Question

You are given an array trees where trees[i] = [xi, yi] are 2D coordinates of trees. You will be using one large rope to enclose all the trees. Return the coordinates of trees that lie exactly on the perimeter of the smallest convex hull containing all the trees. (Points strictly inside the hull are excluded.)

Take a moment to think about this before revealing the answer

Explain your reasoning or try an implementation before comparing answers.

Practice on LeetCode

Explore the full Convex Hull material

Premium includes the complete lessons and implementation references. Free practice questions remain available without a subscription.

All course tracks & premium content

From basics to advanced masterclasses

Built for JS/TS developers like you

Real-world tips & common pitfalls

Upgrade to Premium