Today, we will work on Remove Duplicates from Sorted Array algorithm from LeetCode’s Top Interview Questions List:Given a sorted array nums, remove the duplicates in-place such that each element appears only once and returns the new length.
Given a sorted array _**_nums_, remove the duplicates _[in-place**](https://en.wikipedia.org/wiki/In-place_algorithm)_ such that each element appears only once and returns the new length._
Do not allocate extra space for another array, you must do this by __modifying the input array _[**_in-place**](https://en.wikipedia.org/wiki/In-place_algorithm)_ with O(1) extra memory._
Example 1: Given nums = [1,1,2], Your function should return length = 2, with the first two elements of nums being 1 and 2 respectively. It doesn't matter what you leave beyond the returned length. Example 2: Given nums = [0,0,1,1,1,2,2,3,3,4], Your function should return length = 5, with the first five elements of nums being modified to 0, 1, 2, 3, and 4 respectively. It doesn't matter what values are set beyond the returned length.
Solving algorithms problems is crucial for building a solid computer science foundation for software engineers. Today we will try to solve the Median of Two Sorted Arrays.
By the word Array methods, I mean the inbuilt array functions, which might be helpful for us in so many ways. So why not just explore and make use of them, to boost our productivity. Let’s see them together one by one with some amazing examples.