Codeforces Round 878 (Div. 3) E. Character Blocking
Lonely M’s array
A beauty factor
Minimum indexes
Maximum subsequences
Friendly Neighbors
Codeforces Round 841 (Div. 2) and Divide by Zero 2022 E. Graph Cost
Codeforces Round 821 (Div. 2) D2. Zero-One (Hard Version)
Codeforces Round 826 (Div. 3) F. Multi-Colored Segments
Codeforces Round 828 (Div. 3) F. MEX vs MED