Hello Everyone!!

Problem link

I have got the basic idea of how to approach this problem.

My doubt:-

In the solution given by editorial, when we are moving left end and right end then how are we maintaining the current maximum as we also need to erase some elements from the Tries then how are we maintaining maximum. Are they not deleting elements? I couldn't understand it properly. Can you please explain what exactly are they doing to find the maximum from tries.

Thank You