chore(array) : rename files

Author: dhrubach

simple_array/k_diff_pairs.py simple_array/e_k_diff_pairs.pysimple_array/k_diff_pairs.py renamed to simple_array/e_k_diff_pairs.py

@@ -4,11 +4,12 @@
 # URL : https://leetcode.com/problems/k-diff-pairs-in-an-array/
 ###############################################################
 from collections import Counter
+from typing import List
 
 
 class KDiffPairs:
     # runtime -> 93.76%, memory -> 8.49%
-    def findPairs(self, nums: [int], k: int) -> int:
+    def findPairs(self, nums: List[int], k: int) -> int:
         if k > 0:
             """create a list where each element is k-distance
             from corresponding element in the input list

simple_array/kth_largest.py simple_array/m_kth_largest.pysimple_array/kth_largest.py renamed to simple_array/m_kth_largest.py

@@ -4,10 +4,11 @@
 # URL : https://leetcode.com/problems/kth-largest-element-in-an-array/
 ######################################################################
 from heapq import heapify, heappop
+from typing import List
 
 
 class KLargestElement:
-    def find_bubble_sort(self, nums: [int], k: int) -> int:
+    def find_bubble_sort(self, nums: List[int], k: int) -> int:
         """ using bubble sort
             complexity : O(nk)
                 -> outer loop `k` times, inner loop `n` times
@@ -34,7 +35,7 @@ def find_bubble_sort(self, nums: [int], k: int) -> int:
         """ return kth largest element from the end """
         return nums[len(nums) - k]
 
-    def find_heap(self, nums: [int], k: int) -> int:
+    def find_heap(self, nums: List[int], k: int) -> int:
         """ using heap
             complexity : O(n + k log n)
                 -> O(n) for creating the heap

simple_array/tests/k_diff_pairs_test.py simple_array/tests/e_k_diff_pairs_test.pysimple_array/tests/k_diff_pairs_test.py renamed to simple_array/tests/e_k_diff_pairs_test.py

@@ -1,4 +1,4 @@
-from simple_array.k_diff_pairs import KDiffPairs
+from simple_array.e_k_diff_pairs import KDiffPairs
 
 
 class TestKDiffPairs:

simple_array/tests/kth_largest_test.py simple_array/tests/m_kth_largest_test.pysimple_array/tests/kth_largest_test.py renamed to simple_array/tests/m_kth_largest_test.py

@@ -1,4 +1,4 @@
-from simple_array.kth_largest import KLargestElement
+from simple_array.m_kth_largest import KLargestElement
 
 
 class TestKLargestElement: