Sort Array By Parity

CMakeLists.txt

@@ -524,6 +524,7 @@ add_task(snakes-and-ladders)
 add_task(snapshot-array)
 add_task(solving-questions-with-brainpower)
 add_task(sort-an-array)
+add_task(sort-array-by-parity)
 add_task(sort-characters-by-frequency)
 add_task(sort-colors)
 add_task(sort-integers-by-the-number-of-1-bits)

solutions/sort-array-by-parity/CMakeLists.txt

@@ -0,0 +1 @@
+add_catch(test_sort_array_by_parity test.cpp)

solutions/sort-array-by-parity/solution.hpp

@@ -0,0 +1,12 @@
+#pragma once
+
+#include <algorithm>
+#include <vector>
+
+class Solution {
+public:
+  static std::vector<int> sortArrayByParity(std::vector<int> nums) {
+    std::partition(nums.begin(), nums.end(), [](int a) { return a % 2 == 0; });
+    return nums;
+  }
+};

solutions/sort-array-by-parity/test.cpp

@@ -0,0 +1,15 @@
+#include <catch.hpp>
+
+#include <solution.hpp>
+
+TEST_CASE("Simple") {
+  std::vector<int> nums{0};
+  REQUIRE(nums == Solution::sortArrayByParity(nums));
+}
+
+TEST_CASE("Is Partitioned") {
+  std::vector<int> nums{3, 1, 2, 4};
+  const auto actual = Solution::sortArrayByParity(nums);
+  REQUIRE(std::is_partitioned(actual.begin(), actual.end(),
+                              [](int a) { return a % 2 == 0; }));
+}