Get Minimum Moves

Problem Overview

• Coding interview problem: partition n servers into clusters of size cluster_size so each cluster has equal capacity; a move reduces any server to a smaller integer.
• Input: capacity[n] and cluster_size; Output: minimum moves as an integer.
• Constraint: only decreases are allowed, and a server may be changed multiple times.
• Real-world context: DevOps/server load balancing and capacity standardization.
• Common interview question with no specific company mentioned.