[Help] Palindromic Tree deletion

Правка en2, от Aritra741, 2021-03-10 10:22:14

Problem source: click

The problem states that you'll be given some queries of 2 types. You will either be asked to add a binary digit at the end of the existing string or you'll be asked to delete the last digit. After each operation, you're required to print the longest palindromic substring of that string.

I am aware of a solution involving hashing (Editorial). But I'm wondering how the regular palindromic tree can be modified to handle this.

Теги #string, #palindrome, palindromic tree


  Rev. Язык Кто Когда Δ Комментарий
en2 Английский Aritra741 2021-03-10 10:22:14 19 Tiny change: ' am aware that there exists a solutio' -> ' am aware of a solutio'
en1 Английский Aritra741 2021-03-09 11:06:48 608 Initial revision (published)