All Questions
1
question
3
votes
2
answers
588
views
A Puzzle about "Codeforces Subsequences"
I'm quite intrigued by an "easy" problem in recent Codeforces contest: Codeforces Subsequences.
In this problem, you have to create a string $T$ as shortest as possible such that $S = $ &...
- 34.3k