Chef And Palindromes

CodeChefRating 3209Open on judge ↗

Chef's love for symmetry is well-known. This love is especially expressed for palindromic strings. Today, he has a triplet of strings, A, B, C>, where each string is consisting of lowercase characters. He is interested in counting the number of ordered triplet of strings S1, S2, S3> such that S1, S2, and S3 are non-empty substrings of A, B, and C, respectively, and S1 + S2 + S3 is a palindromic st

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