Freaks City

Problem Description Given a non-strictly increasing (sorted with possible duplicates) integer aray nums, remove the duplicates in-place succh that each unique element appears only once. Maintain the relative order of the unique elements and return the number of unique elements in nums. Let k be the count of unique elements. To pass the test cas ...