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

Solution: Convex Polygon

Explore how to determine if a polygon is convex by computing the cross products of vectors formed by consecutive points. Learn to identify consistent turning directions, using cross product signs to confirm polygon convexity. Understand and implement an efficient O(n) time complexity algorithm to solve convex polygon problems in coding interviews.

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] ...