🟢 Port problem 58 (Length of Last Word) from TypeScript to C++23

solutions/0001-0100/0058-length-of-last-word/README.md

@@ -0,0 +1,11 @@
+# 58. Length of Last Word
+
+[LeetCode problem 58](https://leetcode.com/problems/length-of-last-word/)
+
+- **Difficulty**: Easy
+- **Tags**: string
+
+## Description
+
+Given a string `s` of words and spaces, return the length of the last word
+(a maximal substring of non-space characters).

solutions/0001-0100/0058-length-of-last-word/solution.cpp

@@ -0,0 +1,21 @@
+#include "solution.hpp"
+
+namespace leetcode::p0058 {
+
+int solve(const std::string& s) {
+    int i = static_cast<int>(s.size()) - 1;
+
+    while (i >= 0 && s.at(static_cast<std::size_t>(i)) == ' ') {
+        --i;
+    }
+
+    int length = 0;
+    while (i >= 0 && s.at(static_cast<std::size_t>(i)) != ' ') {
+        ++length;
+        --i;
+    }
+
+    return length;
+}
+
+} // namespace leetcode::p0058

solutions/0001-0100/0058-length-of-last-word/solution.hpp

@@ -0,0 +1,11 @@
+#pragma once
+
+#include <string>
+
+namespace leetcode::p0058 {
+
+// optimized: O(n) time, O(1) space — scan backward from the end, skipping
+// trailing spaces then counting the last word.
+int solve(const std::string& s);
+
+} // namespace leetcode::p0058

solutions/0001-0100/0058-length-of-last-word/test.cpp

@@ -0,0 +1,9 @@
+#include <catch2/catch_test_macros.hpp>
+
+#include "solution.hpp"
+
+TEST_CASE("Problem 58", "[p0058]") {
+    CHECK(leetcode::p0058::solve("Hello World") == 5);
+    CHECK(leetcode::p0058::solve("   fly me   to   the moon  ") == 4);
+    CHECK(leetcode::p0058::solve("luffy is still joyboy") == 6);
+}