Add solution #922

Author: JoshCrozier

README.md

@@ -153,6 +153,7 @@
 890|[Find and Replace Pattern](./0890-find-and-replace-pattern.js)|Medium|
 905|[Sort Array By Parity](./0905-sort-array-by-parity.js)|Easy|
 916|[Word Subsets](./0916-word-subsets.js)|Medium|
+922|[Sort Array By Parity II](./0922-sort-array-by-parity-ii.js)|Easy|
 925|[Long Pressed Name](./0925-long-pressed-name.js)|Easy|
 929|[Unique Email Addresses](./0929-unique-email-addresses.js)|Easy|
 966|[Vowel Spellchecker](./0966-vowel-spellchecker.js)|Medium|

solutions/0922-sort-array-by-parity-ii.js

@@ -0,0 +1,36 @@
+/**
+ * 922. Sort Array By Parity II
+ * https://leetcode.com/problems/sort-array-by-parity-ii/
+ * Difficulty: Easy
+ *
+ * Given an array of integers nums, half of the integers in nums are odd,
+ * and the other half are even.
+ *
+ * Sort the array so that whenever nums[i] is odd, i is odd, and whenever
+ * nums[i] is even, i is even.
+ *
+ * Return any answer array that satisfies this condition.
+ */
+
+/**
+ * @param {number[]} nums
+ * @return {number[]}
+ */
+var sortArrayByParityII = function(nums) {
+  let i = 0;
+  let j = 1;
+
+  while (i < nums.length && j < nums.length) {
+    if (nums[i] % 2 === 0) {
+      i += 2;
+    } else if (nums[j] % 2 === 1) {
+      j += 2;
+    } else {
+      [nums[i], nums[j]] = [nums[j], nums[i]];
+      i += 2;
+      j += 2;
+    }
+  }
+
+  return nums;
+};