Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
- Erect the Fence
Coding
- Paint Fence
Coding
- 0/1 Knapsack Problem with Time Complexity Optimization
Coding
- 01 Matrix
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1924. Erect the Fence II
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source