feat: add PROGRAMMERS-12904

Author: codejsha

coding-test-cpp-practice/src/CMakeLists.txt

@@ -1,3 +1,4 @@
+add_subdirectory(problem12904)
 add_subdirectory(problem12939)
 add_subdirectory(problem42883)
 add_subdirectory(problem43105)

coding-test-cpp-practice/src/problem12904/CMakeLists.txt

@@ -0,0 +1,28 @@
+enable_testing()
+find_package(GTest REQUIRED)
+
+if(WIN32)
+    set(gtest_force_shared_crt ON CACHE BOOL "" FORCE)
+endif(WIN32)
+
+macro(add_library_target target)
+    add_library(${target} STATIC "${target}.cpp")
+    target_link_libraries(${target} PRIVATE ${ARGN})
+    set_property(TARGET ${target} PROPERTY CXX_STANDARD 17)
+endmacro()
+
+macro(add_target_test target)
+    string(REPLACE "_test" "" target_name ${target})
+    add_executable(${target} "${target}.cpp" "${target_name}.cpp")
+    target_link_libraries(${target} PRIVATE GTest::gtest GTest::gtest_main ${ARGN})
+    if(MSVC)
+        ### Edit and Continue for CMake projects
+        target_compile_options(${target} PUBLIC "/Zi")
+        target_link_options(${target} PUBLIC "/INCREMENTAL")
+    endif()
+    gtest_discover_tests(${target})
+endmacro()
+
+add_library_target(longest_palindromic_substring)
+
+add_target_test(longest_palindromic_substring_test)

coding-test-cpp-practice/src/problem12904/longest_palindromic_substring.cpp

@@ -0,0 +1,65 @@
+#include "longest_palindromic_substring.h"
+
+std::string LongestPalindromicSubstring::FindLongestPalindromicSubstring(const std::string& s)
+{
+    auto longest = std::string{};
+    for (auto i = 0; i < s.size(); ++i)
+    {
+        auto left = i;
+        auto right = i;
+        while (left >= 0 && right < s.size() && s[left] == s[right])
+        {
+            --left;
+            ++right;
+        }
+        if (longest.size() < right - left - 1)
+        {
+            longest = s.substr(left + 1, right - left - 1);
+        }
+
+        left = i;
+        right = i + 1;
+        while (left >= 0 && right < s.size() && s[left] == s[right])
+        {
+            --left;
+            ++right;
+        }
+        if (longest.size() < right - left - 1)
+        {
+            longest = s.substr(left + 1, right - left - 1);
+        }
+    }
+    return longest;
+}
+
+int LongestPalindromicSubstring::FindLongestPalindromicSubstringLength(const std::string& s)
+{
+    auto longest = 0;
+    for (auto i = 0; i < s.size(); ++i)
+    {
+        auto left = i;
+        auto right = i;
+        while (left >= 0 && right < s.size() && s[left] == s[right])
+        {
+            --left;
+            ++right;
+        }
+        if (longest < right - left - 1)
+        {
+            longest = right - left - 1;
+        }
+
+        left = i;
+        right = i + 1;
+        while (left >= 0 && right < s.size() && s[left] == s[right])
+        {
+            --left;
+            ++right;
+        }
+        if (longest < right - left - 1)
+        {
+            longest = right - left - 1;
+        }
+    }
+    return longest;
+}

coding-test-cpp-practice/src/problem12904/longest_palindromic_substring.h

@@ -0,0 +1,9 @@
+#pragma once
+
+#include <string>
+
+namespace LongestPalindromicSubstring
+{
+    std::string FindLongestPalindromicSubstring(const std::string& s);
+    int FindLongestPalindromicSubstringLength(const std::string& s);
+}

coding-test-cpp-practice/src/problem12904/longest_palindromic_substring_test.cpp

@@ -0,0 +1,21 @@
+#include "longest_palindromic_substring.h"
+
+#include <gtest/gtest.h>
+
+GTEST_TEST(FindLongestPalindromicSubstring, Successful)
+{
+    const auto s = std::string{"babad"};
+    const auto expected = std::string{"bab"};
+
+    const auto actual = LongestPalindromicSubstring::FindLongestPalindromicSubstring(s);
+    EXPECT_EQ(expected, actual);
+}
+
+GTEST_TEST(FindLongestPalindromicSubstringLength, Successful)
+{
+    const auto s = std::string{"babad"};
+    const auto expected = 3;
+
+    const auto actual = LongestPalindromicSubstring::FindLongestPalindromicSubstringLength(s);
+    EXPECT_EQ(expected, actual);
+}