Rating changes for last rounds are temporarily rolled back. They will be returned soon. ×

tfgs's blog

Interesting Problem About Deleting Adjacent Characters in a Binary String
By tfgs, history, 3 hours ago, In English

You're given a binary string. You can delete two equal adjacent characters however many times you like. Is it true that no matter how you delete adjacent characters, there is a unique shortest string that you can end up with?

I've been stuck on this for a while now. I suspect that the answer is yes, but I have no idea how to prove it. Please help me prove or disprove.

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

»
3 hours ago, # |
  Vote: I like it +5 Vote: I do not like it

noone solves these hard things

→ Reply
»
3 hours ago, # |
  Vote: I like it +6 Vote: I do not like it

Go touch some grass, bro. The obvious counter example is 001 in which you can end up with both 0 and 1 at the end.

→ Reply
  • »
    »
    42 minutes ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Sorry, I forgot to mention they need to be equal.

    → Reply
»
3 hours ago, # |
  Vote: I like it 0 Vote: I do not like it

Idk why but this lowkey feels AI generated

→ Reply
  • »
    »
    40 minutes ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    I actually want to know ._.

    → Reply