Leetcode 3616. Number of Student Replacements

Given two lists describing current and desired student assignments or attributes, compute the minimum number of student replacements required to transform the current distribution into the desired one; the core challenge is comparing multisets/counts and matching deficits (or, if only swaps are allowed, reducing the problem to pairwise matching or flow).