I have the same question, because as per question we have to print longest prefix but here there is an invalid prefix. I implemented it this way but its giving me wrong answer, there should be more clarity on that “longest prefix”.
what will be the valid count for <>>>>><><><><>
For the example 1,
Where is it implied in the STUPMACH problem that we have to put token in the boxes one after another? Cant we put token in box 1, skip box 2 and put token in box 3 as it states distribution of tokens in boxes don’t matter?