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.

Hello, from this problem I know that the minimum number of relocations to sort the array is N-(length of longest non-dec subsequence). Please, can you help me prove this result?

My 2023 programming goals:

• Reach Candidate Master

• Reach USACO Silver division ✓ (USACO January 2023)

• Rank in top 1000 of a contest ✓ (Codeforces Round 856)

• Solve 600 more problems by end of year (398 now)

I will post updates here. Please help me stay accountable!

Happy New Year!