Get Minimum Number of Moves (A.K.A. Weight Lifting Equipments:)

Problem Overview

• Find the minimum adjacent swaps to arrange distinct-weight blocks so the first is lightest and the last is heaviest.
• Input: array blocks of size n; Output: integer count of moves.
• Constraints: 2 ≤ n ≤ 1e5, weights 1–1e9, all distinct.
• Real-world context: stacking weight lifting equipment while shopping on Amazon; an Amazon interviews coding interview problem and interview question.