Merge pull request #1451 from ivan1016017/november10

adding algos

Author: ivanpenaloza

…_frequency_23/round_2/two_sum_round_1.py …uency_23/common_algos/two_sum_round_1.pysrc/my_project/interviews/amazon_high_frequency_23/round_2/two_sum_round_1.py renamed to src/my_project/interviews/amazon_high_frequency_23/common_algos/two_sum_round_1.py src/my_project/interviews/amazon_high_frequency_23/round_2/two_sum_round_1.py renamed to src/my_project/interviews/amazon_high_frequency_23/common_algos/two_sum_round_1.py

@@ -4,13 +4,13 @@
 class Solution:
     def twoSum(self, nums: List[int], target: int) -> List[int]:
 
-        answer = dict()
+        dic_answer = dict()
 
         for k, v in enumerate(nums):
 
-            if v in answer:
-                return [answer[v], k]
+            if v in dic_answer:
+                return [k, dic_answer[v]]
             else:
-                answer[target - v] = k
+                dic_answer[target - v] = k
 
         return []

…_frequency_23/round_2/two_sum_round_6.py …uency_23/common_algos/two_sum_round_2.pysrc/my_project/interviews/amazon_high_frequency_23/round_2/two_sum_round_6.py renamed to src/my_project/interviews/amazon_high_frequency_23/common_algos/two_sum_round_2.py src/my_project/interviews/amazon_high_frequency_23/round_2/two_sum_round_6.py renamed to src/my_project/interviews/amazon_high_frequency_23/common_algos/two_sum_round_2.py

@@ -8,16 +8,17 @@ def isPalindrome(self, s: str) -> bool:
         # To lowercase
         s = s.lower()
 
-        # Remove non-alphanumerical characters
+        # Remove non-alphanumeric characters
         s = re.sub(pattern='[^a-zA-Z0-9]', repl='', string=s)
 
-        # Find if it 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 
 
-        return True
+        return True
+
+