Freaks City

Manacher's Algorithm Purpose Manacher's algorithm computes the longest palindromic substring centered at each position (including positions between characters for even-length palindromes) in O(n) time complexity. Naive Approach The naive method examines each center position and attempts to expand outward character by character until the charact ...

Problem Statement Given a string of length (n), find the length of the longest palindromic substring where (n \le 10^5). Brute-Force Approach A straightforward method involves iterating through each position as a potential center and expanding outward in both directions to check for palindromes. Taking the maximum length among all centers yield ...