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

Solution: Convex Polygon

Explore how to determine whether a polygon is convex by using the cross product of vectors formed by three consecutive points. Understand how consistent turn directions confirm convexity and learn an efficient O(n) time solution to solve this geometric coding problem.

We'll cover the following...

Statement

You are given an array of points on the XY plane, where each point is represented as points[i] = [xi, yi][x_i, \space y_i] ...