Given an integer array nums and an integer val, the task is to remove all occurrences of val in nums in-place. Additionally, we need to return the number of elements in nums that are not equal to val.

The problem at hand is to remove duplicates from a sorted integer array nums in-place, such that each unique element appears only once. Additionally, we need to return the number of unique elements present in the modified array.