Love for Strings

CodeChefOpen on judge ↗

Association of Palindromic strings and Association for sub-strings met at their annual meeting so that they can spread love for strings among people of Byteland. After the meeting they decided to give an interesting question for people of Byteland to think upon. Given a string of length N, you need to find the length of the longest palindromic sub-string which occurs at least K times in the 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