Viewing other problems with insights similar to only this insight from Codeforces 1860D: Balanced String:
The greedy solution of taking the maximum change close to your wanted 0 difference passes the pretests, but fails on the main tests. by Solarion
-
Codeforces 1859D: Andrey and Escape from Capygrad
Shared similar insights
- In a problem involving intervals and the maximum point you can reach using intervals, consider using sweep line and finding intervals left of OR right of the current one. by mathmastersd
- View ALL insights of this problem that are shared
-
Codeforces 1859C: Another Permutation Problem
Shared similar insights
- It was surprisingly easy problem because of the the small range of the variable n (n <= 250) and that allowed a brute force approach that I've considered, but still looking for a more efficient solution even though O(n^2) or O(n^3) are super efficient. Keep in mind that not every problem has tricks by alextm
- View ALL insights of this problem that are shared
-
Codeforces 1834B: Maximum Strength
Shared similar insights
- -When you compare two numbers, at each digit position the maximum strength you can get is 9-0 = 9. by fluffy_mango
- View ALL insights of this problem that are shared
Page 1 of 1.
View links to all pages
1About • Privacy Notice • Rules • Problems list • Journal • Your profile • GitHub
Moon Symbol icon by Icons8 • Sun icon by Icons8 • Emojis from Twemoji by Twitter under CC by 4.0