Merge pull request #1532 from ivanpenaloza/january30

adding algo

Author: ivanpenaloza

src/my_project/interviews/amazon_high_frequency_23/common_algos/two_sum_round_1.py

@@ -10,7 +10,7 @@ def twoSum(self, nums: List[int], target: int) -> List[int]:
 
             if v in answer:
                 return [answer[v], k]
-            else:
+            else: 
                 answer[target - v] = k
-        
+
         return []

src/my_project/interviews/amazon_high_frequency_23/common_algos/two_sum_round_2.py

@@ -11,11 +11,12 @@ def isPalindrome(self, s: str) -> bool:
         # Remove non-alphanumeric characters
         s = re.sub(pattern=r'[^a-zA-Z0-9]', repl='', string=s)
 
-        # Determine if s is palindrome or not
+        # Determine if it is palindrome or not
+
         len_s = len(s)
 
         for i in range(len_s//2):
-
+            
             if s[i] != s[len_s - 1 - i]:
                 return False 
 

src/my_project/interviews/amazon_high_frequency_23/common_algos/two_sum_round_3.py

@@ -1,5 +1,6 @@
 from typing import List, Union, Collection, Mapping, Optional, Dict
 
+
 class Table:
 
     def __init__(self, name:str, columns: int, rows: Dict, row_count: int = 0):
@@ -98,8 +99,6 @@ def exp(self, name: str) -> List[str]:
             result.append(f"{row_id},{row_str}")
 
         return result
-
-
 
 
 

src/my_project/interviews/amazon_high_frequency_23/common_algos/two_sum_round_4.py

@@ -1,4 +1,4 @@
-from typing import List, Union, Collection, Mapping, Optional
+from typing import List, Union, Collection, Mapping, Optional, Dict
 from abc import ABC, abstractmethod
 import math
 
@@ -8,7 +8,5 @@ def minimumTime(self, jobs: List[int], workers: List[int]) -> int:
         jobs.sort()
         workers.sort()
 
-        return max([math.ceil(n/d) for n,d in zip(jobs, workers)])
-
-
-
+        return max([math.ceil(n/d) for n, d in zip(jobs, workers)])
+