Add solution #335

Author: JoshCrozier

README.md

@@ -270,6 +270,7 @@
 331|[Verify Preorder Serialization of a Binary Tree](./0331-verify-preorder-serialization-of-a-binary-tree.js)|Medium|
 332|[Reconstruct Itinerary](./0332-reconstruct-itinerary.js)|Hard|
 334|[Increasing Triplet Subsequence](./0334-increasing-triplet-subsequence.js)|Medium|
+335|[Self Crossing](./0335-self-crossing.js)|Hard|
 337|[House Robber III](./0337-house-robber-iii.js)|Medium|
 338|[Counting Bits](./0338-counting-bits.js)|Easy|
 341|[Flatten Nested List Iterator](./0341-flatten-nested-list-iterator.js)|Medium|

solutions/0335-self-crossing.js

@@ -0,0 +1,33 @@
+/**
+ * 335. Self Crossing
+ * https://leetcode.com/problems/self-crossing/
+ * Difficulty: Hard
+ *
+ * You are given an array of integers distance.
+ *
+ * You start at the point (0, 0) on an X-Y plane, and you move distance[0] meters to the north, then
+ * distance[1] meters to the west, distance[2] meters to the south, distance[3] meters to the east,
+ * and so on. In other words, after each move, your direction changes counter-clockwise.
+ *
+ * Return true if your path crosses itself or false if it does not.
+ */
+
+/**
+ * @param {number[]} d
+ * @return {boolean}
+ */
+var isSelfCrossing = function(d) {
+  for (let i = 3; i < d.length; i++) {
+    if (d[i] >= d[i - 2] && d[i - 1] <= d[i - 3]) {
+      return true;
+    }
+    if (i >= 4 && d[i - 1] === d[i - 3] && d[i] + d[i - 4] >= d[i - 2]) {
+      return true;
+    }
+    if (i >= 5 && d[i - 2] >= d[i - 4] && d[i] + d[i - 4] >= d[i - 2]
+        && d[i - 1] <= d[i - 3] && d[i - 1] + d[i - 5] >= d[i - 3]) {
+      return true;
+    }
+  }
+  return false;
+};