archgaelix

Minimum swaps required to bring elements <= K together

1 min read

https://practice.geeksforgeeks.org/problems/minimum-swaps-required-to-bring-all-elements-less-than-or-equal-to-k-together/0

← Three way partitioning of an array around a given value
Minimum number of merge operations required to make an array palindrome →