3936. Minimum Swaps to Move Zeros to End

You are given an integer array nums. In one operation, you can choose any two distinct indices i and j and swap nums[i] and nums[j]. Return an integer denoting the minimum number of operations required to move all 0s to the end of the array. Example 1: Input: nums = [0,1,0,3,12] Output: 2 Explanation: We perform the following swap operations: - Swap nums[0] and nums[3], giving nums = [3,