3940. Limit Occurrences in Sorted Array

You are given a sorted integer array nums and an integer k. Return an array such that each distinct element appears at most k times, while preserving the relative order of the elements in nums. Note: If a distinct element appears at least k times, then it must appear exactly k times in the resulting array. Example 1: Input: nums = [1,1,1,2,2,3], k = 2 Output: [1,1,2,2,3] Explanation: Each