Palindrome Palindrome

CodeChefRating 2392Open on judge ↗

A string is called beautiful if it has the form AArAAr where A is some non-empty string and Ar is the reversed A. You are given a string S composed only of lowercase letters of the English alphabet. Find the number of its beautiful substrings. Equal substrings in different positions are considered different. For example, the string aaaaa has 2 different substrings because we have beautiful substri

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