// Remove Duplicates from Sorted Array — EASY

// Category: array

Given an integer array `nums` sorted in **non-decreasing order**, remove the duplicates **in-place** such that each unique element appears only once.

Return the number `k` — the count of unique elements. The first `k` elements of `nums` should hold the unique values in order.

**Constraints:**

- `1 <= nums.length <= 3 × 10⁴`

Example: nums = [1,1,2]

Output: 2