Remove Duplicates From Sorted Array | Leetcode Problem 26 | Brute Optimal | C++ Solution

Problem Statement: 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. Problem Link: https://leetcode.com/problems/remove-duplicates-from-sorted-array/ We have solved this question in 2 ways i.e. brute force with the help of stack and optimal solution with two pointer approach. Please like, share and subscribe if you found the video useful. Feel free to ask in the comments section if you have any doubts. 00:00 : Introduction 00:11 : Understanding Question 01:12 : Example 02:48 : Brute Force 07:36 : Optimal Solution 13:18 : Coding #leetcode #leetcodesolution #leetcodequestionandanswers #leetcodequestions #removeduplicates