@@ -0,0 +1,338 @@
+package removeDuplicatesFromSortedArray;%0A%0Apublic class Solution %7B%0A    public int removeDuplicates(int%5B%5D nums) %7B%0A        int fast = 1, slow = 1;%0A        while(fast %3C nums.length)%7B%0A            if(nums%5Bfast%5D != nums%5Bfast-1%5D)%7B%0A                nums%5Bslow++%5D = nums%5Bfast%5D;%0A            %7D%0A            fast++;%0A        %7D%0A        return slow;%0A    %7D%0A%7D

Remove Duplicates from Sorted Array -- easy in place, two pointer