The Simple Task

CodeChefOpen on judge ↗

This is a simple task. You are given a string S of length N. The characters of the string are [S1, S2, S3 … SN]. For every index i, calculate how many palindromic substrings Si is a part of. Input - The first line of the input contains an integer N, the length of the string. - The second line of the input contains the string S Output - Print a single line containing N space separated integers

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