Sort Array by Moving Items to Empty Space

Given an array containing some empty slots, find the minimum number of moves to sort the array when a move consists of taking any item and placing it into an empty position (thus creating a new empty). The core challenge is modeling the arrangement as permutation cycles and optimally using empty slots (and handling duplicates/multiple empties) to break cycles and minimize moves.