Remove Duplicates From Sorted Array 2 | Leetcode Problem 80 | Optimal | C++ Solution

Problem Statement: Given an integer array nums sorted in non-decreasing order, remove some duplicates in-place such that each unique element appears at most twice. The relative order of the elements should be kept the same. Since it is impossible to change the length of the array in some languages, you must instead have the result be placed in the first part of the array nums. Problem Link: https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/description/ I have explained the thought process and logic behind the solution and show how to implement it in code. 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:17 : Understanding Question 02:51 : Understanding Example 04:10 : Understanding Approach 12:47 Coding #leetcode #leetcodesolution #leetcodequestionandanswers #leetcodequestions #removeduplicates