Self Crossing Problem

This article delves into the illustrious Self Crossing problem and looks at how we can solve it. This can be solved efficiently using Computational Geometry ideas.

Table of ContentExamining the Problem StatementSolving the ProblemThe ImplementationConclusionExamining the Problem Statement

Given an array of integers, where each integer represents a distance. You start at coordinate (0,0) then for the length of the array. first, move array[0] meters to the north, then array[1] meters to th...