Skip to content

Commit 88f937b

Browse files
committed
adding algo
1 parent dd5956f commit 88f937b

File tree

3 files changed

+39
-1
lines changed

3 files changed

+39
-1
lines changed

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

Lines changed: 0 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,5 @@
11
from typing import List, Union, Collection, Mapping, Optional
22
from abc import ABC, abstractmethod
3-
import re
43

54
class Solution:
65
def twoSum(self, nums: List[int], target: int) -> List[int]:
Lines changed: 17 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,17 @@
1+
from typing import List, Union, Collection, Mapping, Optional
2+
from abc import ABC, abstractmethod
3+
import re
4+
5+
class Solution:
6+
def twoSum(self, nums: List[int], target: int) -> List[int]:
7+
8+
answer = dict()
9+
10+
for k, v in enumerate(nums):
11+
12+
if v in answer:
13+
return [answer[v], k]
14+
else:
15+
answer[target - v] = k
16+
17+
return []
Lines changed: 22 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,22 @@
1+
from typing import List, Union, Collection, Mapping, Optional
2+
from abc import ABC, abstractmethod
3+
import re
4+
5+
class Solution:
6+
def isPalindrome(self, s: str) -> bool:
7+
8+
# To lowercase
9+
s = s.lower()
10+
11+
# Remove non-alphanumeric characters
12+
s = re.sub(pattern=r'[^a-zA-Z0-9]', repl='', string=s)
13+
14+
# Determine if s is palindrome or not
15+
len_s = len(s)
16+
17+
for i in range(len_s//2):
18+
19+
if s[i] != s[len_s - 1 - i]:
20+
return False
21+
22+
return True

0 commit comments

Comments
 (0)