Merge pull request #1299 from ivan1016017/june11

adding algo

Author: ivanpenaloza

src/my_project/interviews/interview_amazon/round_3/valid_palindrome.py

@@ -0,0 +1,18 @@
+import re 
+
+class Solution:
+    def isPalindrome(self, s: str) -> bool:
+
+        # to lowercase
+        s = s.lower()
+
+        # remove non-alphanumerical characters
+        s = re.sub(pattern='[^a-zA-Z0-9]', repl='', string=s)
+
+        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_17/roman_to_integer.py

@@ -0,0 +1,21 @@
+from typing import List, Union, Collection, Mapping, Optional
+from abc import ABC, abstractmethod
+
+class Solution:
+    def romanToInt(self, s: str) -> int:
+
+        roman_to_dict = {'I':1,'V':5,'X':10,'L':50,'C':100,'D':500,'M':1000}
+
+        len_s = len(s)
+
+        answer = roman_to_dict[s[len_s - 1]]
+
+        for i in range(len_s - 1):
+
+            if roman_to_dict[s[len_s - 2 - i]] \
+                < roman_to_dict[s[len_s - 1 - i]]:
+                answer -= roman_to_dict[s[len_s - 2 - i]]
+            else: 
+                answer += roman_to_dict[s[len_s - 2 - i]]
+
+        return answer 

tests/test_150_questions_round_17/test_roman_to_integer_round_17.py

@@ -0,0 +1,19 @@
+import unittest
+from src.my_project.interviews.top_150_questions_round_17\
+.roman_to_integer import Solution
+
+class RomanToIntegerTestCase(unittest.TestCase):
+
+    def test_patter_one(self):
+        solution = Solution()
+        output = solution.romanToInt(s='VII')
+        target = 7
+        self.assertEqual(output, target)
+
+    def test_patter_two(self):
+        solution = Solution()
+        output = solution.romanToInt(s='IX')
+        target = 9
+        self.assertEqual(output, target)
+
+