Add solution #2161

Author: JoshCrozier

README.md

@@ -662,6 +662,7 @@
 2129|[Capitalize the Title](./2129-capitalize-the-title.js)|Easy|
 2130|[Maximum Twin Sum of a Linked List](./2130-maximum-twin-sum-of-a-linked-list.js)|Medium|
 2154|[Keep Multiplying Found Values by Two](./2154-keep-multiplying-found-values-by-two.js)|Easy|
+2161|[Partition Array According to Given Pivot](./2161-partition-array-according-to-given-pivot.js)|Medium|
 2185|[Counting Words With a Given Prefix](./2185-counting-words-with-a-given-prefix.js)|Easy|
 2215|[Find the Difference of Two Arrays](./2215-find-the-difference-of-two-arrays.js)|Easy|
 2235|[Add Two Integers](./2235-add-two-integers.js)|Easy|

solutions/2161-partition-array-according-to-given-pivot.js

@@ -0,0 +1,31 @@
+/**
+ * 2161. Partition Array According to Given Pivot
+ * https://leetcode.com/problems/partition-array-according-to-given-pivot/
+ * Difficulty: Medium
+ *
+ * You are given a 0-indexed integer array nums and an integer pivot. Rearrange nums such that
+ * the following conditions are satisfied:
+ * - Every element less than pivot appears before every element greater than pivot.
+ * - Every element equal to pivot appears in between the elements less than and greater than
+ *   pivot.
+ * - The relative order of the elements less than pivot and the elements greater than pivot
+ *   is maintained.
+ *   - More formally, consider every pi, pj where pi is the new position of the ith element
+ *     and pj is the new position of the jth element. If i < j and both elements are smaller
+ *     (or larger) than pivot, then pi < pj.
+ *
+ * Return nums after the rearrangement.
+ */
+
+/**
+ * @param {number[]} nums
+ * @param {number} pivot
+ * @return {number[]}
+ */
+var pivotArray = function(nums, pivot) {
+  return [
+    ...nums.filter(x => x < pivot),
+    ...nums.filter(x => x === pivot),
+    ...nums.filter(x => x > pivot),
+  ];
+};