# Keep At Most K Copies in a Sorted Array Implement `dedupe_sorted(nums, k)`. Modify the sorted input array in place so each distinct integer appears at most `k` times while order is preserved, and return the retained prefix as an integer array. Use the input as the write buffer with `O(1)` working space; the returned prefix is the portable graded value in all four languages. Constraints: up to `200000` integers; each is in `[-10^9, 10^9]`; `0 <= k <= 200000`. ```hint Exercise each multiplicity boundary Test a value appearing fewer than, exactly, and more than `k` times, plus `k = 0`. ```