26. Remove Duplicates from Sorted Array | C++ Solution | LeetCode Easy

In this video, we solve LeetCode Problem 26: Remove Duplicates from Sorted Array using C++. We are given an integer array nums sorted in non-decreasing order, and we need to remove the duplicates in-place so that each unique element appears only once. The relative order of the elements should remain the same, and we need to return the number of unique elements k. In this solution, we cover: - What the problem is asking - Why the array is already sorted - How to use the two-pointer approach - How to place unique elements at the correct position - Why we return k as the final answer - Time and space complexity explanation Approach: We use a variable k to track the position where the next unique element should be placed. We start from the second element and compare nums[i] with nums[i - 1]. If nums[i] is different from nums[i - 1], it means we found a new unique element, so we place it at nums[k] and increment k. Finally, k represents the total number of unique elements in the array. Complexity: Time Complexity: O(n) Space Complexity: O(1) If you found this explanation helpful, like the video and subscribe for more LeetCode solutions in C++. 🔗 Connect with me: GitHub: https://github.com/atulXdev LeetCode Profile: https://leetcode.com/u/atul_singh_cg/ LinkedIn: https://www.linkedin.com/in/atul-singh-987b0b394/ Tags: LeetCode 26 Remove Duplicates from Sorted Array C++ LeetCode C++ Solution Two Pointer Approach In-place Algorithm DSA Coding Interview C++ LeetCode Array Problem