Available question text
Given two equal-length strings a and b, determine whether there exists a split index such that a_prefix + b_suffix or b_prefix + a_suffix is a palindrome. The core challenge is efficiently matching characters from opposite ends across the two strings (a two-pointer cross-check) and verifying the remaining middle segment is a palindrome.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1616. Split Two Strings to Make Palindrome
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source