Binary Palindrome

CodeChefOpen on judge ↗

You are writing in your favourite editor starting with a blank editor. In each operation you can either type a binary digit (i.e a $0$ or $1$) or type backspace which removes the rightmost typed character on the screen. After every operation you are required to print the length of the longest palindromic substring that is present on the screen. There are $N$ operations of two types - - **1 $d$*

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