Fetching data...
This may take a moment
Back
2074. Erect the Fence II
Hard
Array
Math
Geometry
Solve on LeetCode
View Solutions
Description
Hints
Hint 1
First, we need to note that this is a classic problem given n points you need to find the minimum enclosing circle to bind them
Hint 2
Second, we need to apply a well known algorithm called welzls algorithm to help us find the minimum enclosing circle
Similar Questions
Erect the Fence
Hard
Statistics
Acceptance
50.9%
Submissions
1,861
Accepted
948