🟢 Port problem 27 (Remove Element) from TypeScript to C++23

solutions/0001-0100/0027-remove-element/README.md

@@ -0,0 +1,12 @@
+# 27. Remove Element
+
+[LeetCode problem 27](https://leetcode.com/problems/remove-element/)
+
+- **Difficulty**: Easy
+- **Tags**: array, two-pointers
+
+## Description
+
+Given an array `nums` and a value `val`, remove all occurrences of `val` in
+place and return the number of remaining elements `k`; the first `k`
+elements of `nums` must hold the result, in any order.

solutions/0001-0100/0027-remove-element/solution.cpp

@@ -0,0 +1,18 @@
+#include "solution.hpp"
+
+namespace leetcode::p0027 {
+
+int solve(std::vector<int>& nums, int val) {
+    int k = 0;
+
+    for (int num : nums) {
+        if (num != val) {
+            nums.at(static_cast<std::size_t>(k)) = num;
+            ++k;
+        }
+    }
+
+    return k;
+}
+
+} // namespace leetcode::p0027

solutions/0001-0100/0027-remove-element/solution.hpp

@@ -0,0 +1,10 @@
+#pragma once
+
+#include <vector>
+
+namespace leetcode::p0027 {
+
+// optimized: O(n) time, O(1) extra space — overwrite in place, one pass.
+int solve(std::vector<int>& nums, int val);
+
+} // namespace leetcode::p0027

solutions/0001-0100/0027-remove-element/test.cpp

@@ -0,0 +1,11 @@
+#include <catch2/catch_test_macros.hpp>
+
+#include "solution.hpp"
+
+TEST_CASE("Problem 27", "[p0027]") {
+    std::vector<int> a{3, 2, 2, 3};
+    CHECK(leetcode::p0027::solve(a, 3) == 2);
+
+    std::vector<int> b{0, 1, 2, 2, 3, 0, 4, 2};
+    CHECK(leetcode::p0027::solve(b, 2) == 5);
+}