DSA/codeforces (2)

all atcoder (1)codeforces (2)leetcode (59)
[Cover in Water] <800> (problem)
Wednesday, 9 September 2026 : 2 min read

TODO

{constructive algorithms}{greedy}
[Halloumi Boxes] <800> (problem)
Wednesday, 9 September 2026 : 2 min read

A reversal of length 2 is an adjacent swap, and adjacent swaps sort anything — so the whole problem collapses to `k == 1`.

{greedy}{sortings}
quantinium © 2026