Remove Duplicates from Sorted Array

Problem Statement Given a sorted integer array nums , remove the duplicates in-place such that each unique element appears only once. Return the number of unique elements k . The first k elements of the array should contain the unique elements in their original order. Example Input: nums = [1,1,2] Output: 2 Modified Array: [1,2,_] Brute Force Intuition (Interview Explanation) One straightforward approach is to use a separate data structure like a HashSet to store unique elements. As we traverse