Dsa
Two Pointers
Easy
Palindrome Substring Finder
You are given a string of lowercase letters. Write a program to find the longest palindrome substring using two-pointer technique. A palindrome reads the same backward as forward.
Input:
- A single line containing the string (1 ≤ |s| ≤ 100000).
Output:
- The longest palindrome substring.
Example:
Input:
abacdfgdcaba
Output:
abacdfgdcaba
Key concepts
two_pointersstringspalindrome
Practise this out loud — free
Start a mock interview on THIS exact question — a voice AI interviewer opens with it, pushes back like a real onsite, then hands you an instant scorecard.
🎙 Practise this question now