Lost Algorithm

CodeChefOpen on judge ↗

You have given a string $S$ of lenght $N$ consisting of only lowercase english letters. Let F(S) = no of **unique palindromic substrings** in $S$ You need to minimize F(s) by doing following operation exactly once. Choose a index **i** and replace $S_i$ with 0. Find the minimum value of F(S) and also find the index which gives minimum

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