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

Solution: Erect the Fence

Explore the solution for erecting the shortest possible fence around trees by computing their convex hull. Understand how to apply the Monotone Chain algorithm, leveraging sorting and orientation checks, to identify the boundary points enclosing all trees efficiently.

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\leq ...