Added Manacher Algorithm

Author: donutt03

src/main/java/com/thealgorithms/strings/Manacher.java

@@ -0,0 +1,87 @@
+package com.thealgorithms.strings;
+
+/**
+ * Wikipedia: https://en.wikipedia.org/wiki/Longest_palindromic_substring#Manacher's_algorithm
+ */
+public final class Manacher {
+
+    // Private constructor to prevent instantiation
+    private Manacher() {
+    }
+
+    /**
+     * Test code for Manacher's Algorithm
+     */
+    public static void main(String[] args) {
+        assert longestPalindrome("babad").equals("bab") || longestPalindrome("babad").equals("aba");
+        assert longestPalindrome("cbbd").equals("bb");
+        assert longestPalindrome("a").equals("a");
+        assert longestPalindrome("ac").equals("a") || longestPalindrome("ac").equals("c");
+    }
+
+    /**
+     * Finds the longest palindromic substring using Manacher's Algorithm
+     *
+     * @param s The input string
+     * @return The longest palindromic substring in {@code s}
+     */
+    public static String longestPalindrome(String s) {
+        // Preprocess the string to avoid even-length palindrome issues
+        String processedString = preprocess(s);
+        int n = processedString.length();
+        int[] P = new int[n]; // Array to store the radius of palindromes
+        int center = 0, rightBoundary = 0; // Current center and right boundary of the palindrome
+        int maxLen = 0, centerIndex = 0; // To track the longest palindrome
+
+        // Iterate over the preprocessed string to calculate the palindrome radii
+        for (int i = 1; i < n - 1; i++) {
+            // Mirror the current index i to find its corresponding mirrored index
+            int mirror = 2 * center - i;
+
+            // If the current index is within the right boundary, mirror the palindrome radius
+            if (i < rightBoundary) {
+                P[i] = Math.min(rightBoundary - i, P[mirror]);
+            }
+
+            // Try to expand the palindrome centered at i
+            while (processedString.charAt(i + 1 + P[i]) == processedString.charAt(i - 1 - P[i])) {
+                P[i]++;
+            }
+
+            // Update center and right boundary if palindrome expands beyond current right boundary
+            if (i + P[i] > rightBoundary) {
+                center = i;
+                rightBoundary = i + P[i];
+            }
+
+            // Track the maximum length and center index of the longest palindrome found so far
+            if (P[i] > maxLen) {
+                maxLen = P[i];
+                centerIndex = i;
+            }
+        }
+
+        // Extract the longest palindrome from the original string
+        int start = (centerIndex - maxLen) / 2; // Get the starting index in the original string
+        return s.substring(start, start + maxLen);
+    }
+
+    /**
+     * Preprocesses the input string by inserting a special character ('#') between each character
+     * and adding '^' at the start and '$' at the end to avoid boundary conditions.
+     *
+     * @param s The original string
+     * @return The preprocessed string with additional characters
+     */
+    private static String preprocess(String s) {
+        if (s.isEmpty()) {
+            return "^$";
+        }
+        StringBuilder sb = new StringBuilder("^");
+        for (char c : s.toCharArray()) {
+            sb.append('#').append(c);
+        }
+        sb.append("#$");
+        return sb.toString();
+    }
+}

src/test/java/com/thealgorithms/strings/ManacherTest.java

@@ -0,0 +1,36 @@
+package com.thealgorithms.strings;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import org.junit.jupiter.api.Test;
+
+public class ManacherTest {
+
+    @Test
+    public void testLongestPalindrome() {
+        assertEquals("aabcdefggfedcbaa", Manacher.longestPalindrome("abracadabraabcdefggfedcbaabracadabra")); // Long string with embedded palindrome
+        assertEquals("racecar", Manacher.longestPalindrome("somelongtextwithracecarmiddletext")); // Longer string with racecar palindrome
+        assertEquals("ananananananana", Manacher.longestPalindrome("bananananananana")); // Repetitive pattern with palindrome
+        assertEquals("defgfed", Manacher.longestPalindrome("qwertydefgfedzxcvbnm")); // Palindrome in middle of long string
+        assertEquals("abcdefghijklmnopqrstuvwxyzzyxwvutsrqponmlkjihgfedcba", Manacher.longestPalindrome("abcdefghijklmnopqrstuvwxyzzyxwvutsrqponmlkjihgfedcba")); // Symmetrical section
+    }
+
+    @Test
+    public void testEmptyAndSingle() {
+        assertEquals("", Manacher.longestPalindrome("")); // Empty string
+        assertEquals("a", Manacher.longestPalindrome("a")); // Single character
+    }
+
+    @Test
+    public void testComplexCases() {
+        assertEquals("tattarrattat", Manacher.longestPalindrome("abcdefghijklmnopqrstuvwxyzttattarrattatabcdefghijklmnopqrstuvwxyz")); // Long palindrome inside a large string
+        assertEquals("aaaaabaaaaa", Manacher.longestPalindrome("aaaaabaaaaacbaaaaa")); // Large repetitive character set
+        assertEquals("abcdefghhgfedcba", Manacher.longestPalindrome("sometextrandomabcdefgabcdefghhgfedcbahijklmnopqrstuvwxyz")); // Large string with clear palindromic section
+        assertEquals("madaminedenimadam", Manacher.longestPalindrome("therewasasignthatsaidmadaminedenimadamitwasthereallalong")); // Famous palindrome within a long string
+    }
+
+    @Test
+    public void testSentencePalindromes() {
+        assertEquals("lanacanal", Manacher.longestPalindrome("XThisisalongtextbuthiddeninsideisAmanaplanacanalPanamaWhichweknowisfamous"));
+        assertEquals("everoddoreve", Manacher.longestPalindrome("AverylongstringthatcontainsNeveroddoreveninahiddenmanner")); // Another sentence-like palindrome
+    }
+}