Search⌘ K
AI Features

Erect the Fence

Explore methods to enclose a set of points by forming the shortest fence that creates a convex hull around them. Understand how to identify points on the fence perimeter and apply these concepts to coding interview challenges involving geometry and optimization.

Statement

You are given an array of points, trees, where trees[i] = [xᵢ, yᵢ] represents the location of a tree on a 2D plane. Your goal is to enclose all the trees using the shortest possible length of rope, forming a fence around the garden. A garden is considered well-fenced if every tree lies inside or on the boundary of the fence (i.e., the fence forms the convex hullThis is the smallest convex shape, completely encloses a set of points. of all the points).

Return the coordinates of the trees that lie exactly on the fence perimeter. You can return the answer in any order.

Constraints:

  • ...