chore(array) : rename files

Author: dhrubach

simple_array/README.md

@@ -2,13 +2,19 @@
 
 ## easy
 
+- Advance By Offsets
 - [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/)
+- Increment Any Arbitrary Precision Integer
 - [K-Diff Pairs in an Array](https://leetcode.com/problems/k-diff-pairs-in-an-array/)
+- Minimum Steps To End
 - [Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array/)
+- [Shortest Unsorted Continuous Subarray](https://leetcode.com/problems/shortest-unsorted-continuous-subarray/)
+- [Third Maximum Number](https://leetcode.com/problems/third-maximum-number/)
 
 ## medium
 
 - [kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array/)
+- Multiply Two Arbitrary Precision Integers
 - [Remove Duplicates from Sorted Array II](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/)
 
 ## hard

simple_array/advance_by_offsets.py simple_array/e_advance_by_offsets.pysimple_array/advance_by_offsets.py renamed to simple_array/e_advance_by_offsets.py

@@ -3,11 +3,12 @@
 # Difficulty Level : Easy
 # URL : https://leetcode.com/problems/shortest-unsorted-continuous-subarray/
 ############################################################################
+from typing import List
 
 
 class ShortestSubArray:
     # runtime - 76.59%, memory - 52.05%
-    def findUnsortedSubarray(self, nums: [int]) -> (int, [int]):
+    def findUnsortedSubarray(self, nums: List[int]) -> int:
         if not nums:
             return 0
 
@@ -29,13 +30,13 @@ def findUnsortedSubarray(self, nums: [int]) -> (int, [int]):
                 start = index if start == -1 else start
                 end = index
 
-        return (end - start + 1 if start != -1 else 0, sarr[end:start])
+        return end - start + 1 if start != -1 else 0
 
-    def findUnsortedSubarray_concise(self, nums: [int]) -> int:
+    def findUnsortedSubarray_concise(self, nums: List[int]) -> int:
         res = [i for (i, (a, b)) in enumerate(zip(nums, sorted(nums))) if a != b]
         return 0 if not res else (res[-1] - res[0] + 1)
 
-    def findUnsortedSubarray_no_sort(self, nums: [int]) -> int:
+    def findUnsortedSubarray_no_sort(self, nums: List[int]) -> int:
         start, end = 0, len(nums) - 1
 
         """ 'start' is the first index position where a number

simple_array/int_as_array_increment.py simple_array/e_int_as_array_increment.pysimple_array/int_as_array_increment.py renamed to simple_array/e_int_as_array_increment.py

@@ -3,12 +3,13 @@
 # Difficulty Level : Easy
 # URL : https://leetcode.com/problems/third-maximum-number/
 ############################################################
+from typing import List
 
 
 class ThirdLargestNumber:
     # runtime -> 97.90%, memory -> 83.47%
     # complexity -> time O(n), space O(1)
-    def find(self, nums: [int]) -> int:
+    def find(self, nums: List[int]) -> int:
         if len(nums) < 3:
             return max(nums)
 

simple_array/min_steps_to_end.py simple_array/e_min_steps_to_end.pysimple_array/min_steps_to_end.py renamed to simple_array/e_min_steps_to_end.py

@@ -1,4 +1,4 @@
-from simple_array.advance_by_offsets import AdvanceByOffsets
+from simple_array.e_advance_by_offsets import AdvanceByOffsets
 
 
 class TestAdvanceByOffsets:

simple_array/shortest_cont_sub_array.py simple_array/e_shortest_cont_sub_array.pysimple_array/shortest_cont_sub_array.py renamed to simple_array/e_shortest_cont_sub_array.py

@@ -1,4 +1,4 @@
-from simple_array.int_as_array_increment import IncrementArray
+from simple_array.e_int_as_array_increment import IncrementArray
 
 
 class TestIncrementArray:

simple_array/third_largest.py simple_array/e_third_largest.pysimple_array/third_largest.py renamed to simple_array/e_third_largest.py

@@ -1,4 +1,4 @@
-from simple_array.min_steps_to_end import MinimumStepsToEnd
+from simple_array.e_min_steps_to_end import MinimumStepsToEnd
 
 
 class TestMinimumStepsToEnd: