Point-in-Polygon for Zones | Dataford Interview Questions

Write a function to determine if a point lies within a 2D polygon representing a utility service zone for Neara. Implement def point_in_polygon(point, polygon):, where point is a two-element sequence and polygon is an ordered list of at least three vertices. Return True for points inside or on the polygon boundary, and False otherwise; assume the polygon is simple and vertices are connected cyclically.

Constraints

3 <= len(polygon) <= 1000
Each point is a two-element sequence of integers or floating-point values
The polygon is simple and its vertices are listed in boundary order
The polygon is not required to be convex
Points on the boundary count as inside

Function Signature

def point_in_polygon(point, polygon):

Your question is Point-in-Polygon for Zones. 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

3 <= len(polygon) <= 1000
Each point is a two-element sequence of integers or floating-point values
The polygon is simple and its vertices are listed in boundary order
The polygon is not required to be convex
Points on the boundary count as inside

Function Signature

def point_in_polygon(point, polygon):

Your question is Point-in-Polygon for Zones. 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.