Search⌘ K
AI Features
Home
Courses
Grokking the Coding Interview Patterns in Go

Solution: Erect the Fence

Explore the Erect the Fence problem by learning to compute the convex hull around points representing trees. Understand sorting points, constructing lower and upper hulls using the orientation check, and combining them for the minimal enclosing fence. Practice implementing the Monotone Chain algorithm and analyze the solution's time and space complexity.

We'll cover the following...

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:

  • 1≤1 \leq trees.length ≤300\leq 300

  • trees[i].length == 22

  • 0≤0 \leq xi, yi ≤100 ...