Add solution #1073

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,113 LeetCode solutions in JavaScript
+# 1,114 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -853,6 +853,7 @@
 1051|[Height Checker](./solutions/1051-height-checker.js)|Easy|
 1071|[Greatest Common Divisor of Strings](./solutions/1071-greatest-common-divisor-of-strings.js)|Easy|
 1072|[Flip Columns For Maximum Number of Equal Rows](./solutions/1072-flip-columns-for-maximum-number-of-equal-rows.js)|Medium|
+1073|[Adding Two Negabinary Numbers](./solutions/1073-adding-two-negabinary-numbers.js)|Medium|
 1079|[Letter Tile Possibilities](./solutions/1079-letter-tile-possibilities.js)|Medium|
 1081|[Smallest Subsequence of Distinct Characters](./solutions/1081-smallest-subsequence-of-distinct-characters.js)|Medium|
 1092|[Shortest Common Supersequence](./solutions/1092-shortest-common-supersequence.js)|Hard|

solutions/1073-adding-two-negabinary-numbers.js

@@ -0,0 +1,42 @@
+/**
+ * 1073. Adding Two Negabinary Numbers
+ * https://leetcode.com/problems/adding-two-negabinary-numbers/
+ * Difficulty: Medium
+ *
+ * Given two numbers arr1 and arr2 in base -2, return the result of adding them together.
+ *
+ * Each number is given in array format:  as an array of 0s and 1s, from most significant
+ * bit to least significant bit.  For example, arr = [1,1,0,1] represents the number
+ * (-2)^3 + (-2)^2 + (-2)^0 = -3.  A number arr in array, format is also guaranteed to
+ * have no leading zeros: either arr == [0] or arr[0] == 1.
+ *
+ * Return the result of adding arr1 and arr2 in the same format: as an array of 0s and 1s
+ * with no leading zeros.
+ */
+
+/**
+ * @param {number[]} arr1
+ * @param {number[]} arr2
+ * @return {number[]}
+ */
+var addNegabinary = function(arr1, arr2) {
+  const result = [];
+  let i = arr1.length - 1;
+  let j = arr2.length - 1;
+  let carry = 0;
+
+  while (i >= 0 || j >= 0 || carry !== 0) {
+    const x = i >= 0 ? arr1[i--] : 0;
+    const y = j >= 0 ? arr2[j--] : 0;
+    const sum = x + y + carry;
+
+    result.unshift(sum & 1);
+    carry = sum >= 2 ? -1 : sum < 0 ? 1 : 0;
+  }
+
+  while (result.length > 1 && result[0] === 0) {
+    result.shift();
+  }
+
+  return result;
+};