adding updates

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

@@ -0,0 +1,21 @@
+from typing import List, Union, Collection, Mapping, Optional
+from abc import ABC, abstractmethod
+
+class Solution:
+    def twoSum(self, nums: List[int], target: int) -> List[int]:
+
+        answer = dict()
+
+        for k, v in enumerate(nums):
+
+            if v in answer:
+                return [answer[v], k]
+            else:
+                answer[target - v] = k
+
+        return []
+
+
+
+
+

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

@@ -0,0 +1,22 @@
+from typing import List, Union, Collection, Mapping, Optional
+from abc import ABC, abstractmethod
+import re
+
+class Solution:
+    def isPalindrome(self, s: str) -> bool:
+
+        # To lowercase
+        s = s.lower()
+
+        # Remove non-alphanumeric characters
+        s = re.sub(pattern=r'[^a-zA-Z0-9]', repl='', string=s)
+
+        # Determine if s 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 

src/my_project/interviews/top_150_questions_round_22/ex_127_plus_one.py

@@ -0,0 +1,19 @@
+from typing import List 
+
+class Solution:
+    def plusOne(self, digits: List[int]) -> List[int]:
+
+        len_digits = len(digits)
+
+        for i in range(len_digits - 1, -1, -1):
+
+            if digits[i] != 9:
+                digits[i] += 1
+                break
+            else:
+                digits[i] = 0
+
+        if digits[0] == 0:
+            return [1] + digits
+        else: 
+            return digits

src/my_project/interviews_typescript/top_150_questions_round_1/ex_127_plus_one.ts

@@ -0,0 +1,10 @@
+function plusOne(digits: number[]): number[] {
+    for (let i = digits.length - 1; i >= 0; i--) {
+        if (digits[i] !== 9) {
+            digits[i]++;
+            return digits;
+        }
+        digits[i] = 0;
+    }
+    return [1, ...digits];
+};

tests/test_150_questions_round_22/test_127_plus_one_round_22.py

@@ -0,0 +1,19 @@
+import unittest
+from src.my_project.interviews.top_150_questions_round_22\
+.ex_127_plus_one import Solution
+
+class PlusOneTestCase(unittest.TestCase):
+
+    def test_leading_one(self):
+        solution = Solution()
+        output = solution.plusOne(digits=[9])
+        target = [1, 0] 
+        for k, v in enumerate(target):
+            self.assertEqual(v, output[k])
+
+    def test_no_leading_one(self):
+        solution = Solution()
+        output = solution.plusOne(digits=[1, 2])
+        target = [1, 3] 
+        for k, v in enumerate(target):
+            self.assertEqual(v, output[k])