From c4131c7657f10d0683adc445a99948e358ed7859 Mon Sep 17 00:00:00 2001 From: ivan Date: Fri, 12 Jun 2026 07:59:17 -0600 Subject: [PATCH] adding updates --- .../common_algos/two_sum_round_5.py | 18 +++++++++++++++ .../common_algos/valid_palindrome_round_5.py | 22 +++++++++++++++++++ .../round_6/longest_common_subsequence.py | 22 +++++++++++++++++++ 3 files changed, 62 insertions(+) create mode 100644 src/my_project/interviews/amazon_high_frequency_23/common_algos/two_sum_round_5.py create mode 100644 src/my_project/interviews/amazon_high_frequency_23/common_algos/valid_palindrome_round_5.py create mode 100644 src/my_project/interviews/amazon_high_frequency_23/round_6/longest_common_subsequence.py diff --git a/src/my_project/interviews/amazon_high_frequency_23/common_algos/two_sum_round_5.py b/src/my_project/interviews/amazon_high_frequency_23/common_algos/two_sum_round_5.py new file mode 100644 index 00000000..d5cc7cd1 --- /dev/null +++ b/src/my_project/interviews/amazon_high_frequency_23/common_algos/two_sum_round_5.py @@ -0,0 +1,18 @@ +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 [] + + diff --git a/src/my_project/interviews/amazon_high_frequency_23/common_algos/valid_palindrome_round_5.py b/src/my_project/interviews/amazon_high_frequency_23/common_algos/valid_palindrome_round_5.py new file mode 100644 index 00000000..682f2b9c --- /dev/null +++ b/src/my_project/interviews/amazon_high_frequency_23/common_algos/valid_palindrome_round_5.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 \ No newline at end of file diff --git a/src/my_project/interviews/amazon_high_frequency_23/round_6/longest_common_subsequence.py b/src/my_project/interviews/amazon_high_frequency_23/round_6/longest_common_subsequence.py new file mode 100644 index 00000000..d5d4d0af --- /dev/null +++ b/src/my_project/interviews/amazon_high_frequency_23/round_6/longest_common_subsequence.py @@ -0,0 +1,22 @@ +from typing import List, Union, Collection, Mapping, Optional + +class Solution: + def longestCommonSubsequence(self, text1: str, text2: str) -> int: + + # Make a grid of 0's with len(text2) + 1 columns + # and len(text1) + 1 rows. + len_1 = len(text1) + len_2 = len(text2) + dp_grid = [[0]*(len_2+1) for _ in range(len_1+1)] + + # Iterate up each column, starting from the last one. + for j in reversed(range(len_2)): + for i in reversed(range(len_1)): + if text1[i] == text2[j]: + dp_grid[i][j] = dp_grid[i+1][j+1] + 1 + else: + dp_grid[i][j] = max(dp_grid[i+1][j], dp_grid[i][j+1]) + + # The original problem's answer is in dp_grid[0][0]. Return it. + return dp_grid[0][0] +