I've never taken a coding test, and I'm trying to figure out the spirit of the question here, want to make sure I'm doing this correctly.
Here is an example question: Given an integer array nums sorted in non-decreasing order*, remove the duplicates* in-place such that each unique element appears only once*. The* relative order of the elements should be kept the same*. Then return the number of unique elements in nums. Consider the number of unique elements of nums to be k, to get accepted, you need to do the following things:*
- *Change the array nums such that the first k elements of nums contain the
