Leetcode 1864. Minimum Number of Swaps to Make the Binary String Alternating

Determine whether the counts of 0s and 1s allow an alternating arrangement (they can differ by at most 1), and if so compute the minimum swaps by comparing s to the two possible alternating targets ("0101..." and "1010...") and taking the smaller mismatch-based swap count; return -1 if impossible.