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

Solution: Convex Polygon

Explore how to determine if a polygon formed by a series of XY points is convex by calculating cross products of consecutive points. Understand the method to check turn directions and implement an O(n) time complexity algorithm for solving 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] ...