Aritra741's blog

By Aritra741, history, 6 weeks ago, In English

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.

 
 
 
 
  • Vote: I like it
  • -9
  • Vote: I do not like it

»
6 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been updated by Aritra741 (previous revision, new revision, compare).

»
6 weeks ago, # |
  Vote: I like it +8 Vote: I do not like it

You mean something like this solution?