Editorial for CCC '16 J3 - Hidden Palindrome

Remember to use this editorial only when stuck, and not to copy-paste code from it. Please be respectful to the problem author and editorialist.
Submitting an official solution before solving the problem yourself is a bannable offence.

Brute forcing all substrings in $\mathcal{O}(N^3)$ $O (N^{3})$ is sufficient to pass. A more efficient approach would be to use Manacher's Algorithm, which runs in $\mathcal{O}(N)$ $O (N)$ .

Time Complexity: $\mathcal{O}(N^3)$ $O (N^{3})$ or $\mathcal{O}(N)$ $O (N)$ .

Comments

1

RickyFang11287 commented 3 days ago ← edited →

How can you copy the code if there's no code at all.