Update Solution.py

Author: Tahanima

Algorithms/Easy/26_RemoveDuplicatesFromSortedArray/Solution.py

@@ -5,9 +5,9 @@ def removeDuplicates(self, nums: List[int]) -> int:
         # otherwise go forward
 
         i = 1
-        while i<len(nums):
-            if nums[i-1] == nums[i]:
-                nums.pop(i-1)
+        while i < len(nums):
+            if nums[i - 1] == nums[i]:
+                nums.pop(i - 1)
             else:
                 i += 1