Compute Convex Hull Boundary | Dataford Interview Questions

Given an array of 2D integer points points, where each point is [x, y], return all points that lie on the boundary of the convex hull of the set. Include collinear points that lie on the hull boundary. The output may be returned in any order, but each boundary point should appear only once.

Constraints

1 <= len(points) <= 3000
points[i].length == 2
0 <= x, y <= 10^4
All points are distinct

Function Signature

def convex_hull(points):

Your question is Compute Convex Hull Boundary. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Constraints

1 <= len(points) <= 3000
points[i].length == 2
0 <= x, y <= 10^4
All points are distinct

Function Signature

def convex_hull(points):

Your question is Compute Convex Hull Boundary. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.