Shortest Palindrome

CodeChefOpen on judge ↗

You are given a string $s$ consisting of lowercase English letters. You can convert $s$ into a **palindrome** by adding characters **only at the beginning** of the string. Your task is to **find the shortest palindrome** that can be obtained using this transformation. ## Function Declaration ### Function Name $shortestPalindrome$ – This function finds the shortest palindrome that can be formed

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI