[main] Added functions

Author: cthacker-udel

pythonProblems/leetcode/intToRoman.py

@@ -0,0 +1,36 @@
+class Solution:
+    def intToRoman(self, num: int) -> str:
+        values = {
+            1: "I",
+            4: "IV",
+            5: "V",
+            9: "IX",
+            10: "X",
+            40: "XL",
+            50: "L",
+            90: "XC",
+            100: "C",
+            400: "CD",
+            500: "D",
+            900: "CM",
+            1000: "M"
+        }
+
+        output = ''
+        value_keys = [1, 4, 5, 9, 10, 40, 50, 90, 100, 400, 500, 900, 1000]
+        starting_value = 12
+
+        while num > 0:
+            val_ = value_keys[starting_value]
+            if num >= val_:
+                num -= val_
+                output += values[value_keys[starting_value]]
+            else:
+                starting_value -= 1
+
+        return output
+
+
+if __name__ == '__main__':
+    sol = Solution()
+    sol.intToRoman(58)

pythonProblems/leetcode/longestCommonPrefix.py

@@ -0,0 +1,33 @@
+from sys import prefix
+from typing import List
+
+
+class Solution:
+    def longestCommonPrefix(self, strs: List[str]) -> str:
+        if len(strs) > 0:
+            strs = sorted(strs, key=len)
+            base_word = strs[0]
+            if base_word == '':
+                return ''
+            _ind = 0
+            min_len = len(strs[0])
+            valid_prefix = True
+            prefix = ''
+            while _ind <= min_len:
+                for i in range(len(strs)):
+                    if not strs[i].startswith(prefix):
+                        valid_prefix = False
+                        break
+                if not valid_prefix:
+                    return prefix[:-1]
+                else:
+                    prefix += base_word[_ind] if _ind != min_len else ''
+                    _ind += 1
+            return prefix
+        return ''
+
+
+if __name__ == '__main__':
+    arr = ["a", "b"]
+    sol = Solution()
+    print(sol.longestCommonPrefix(arr))

pythonProblems/leetcode/romanToInt.py

@@ -0,0 +1,37 @@
+class Solution:
+    def romanToInt(self, s: str) -> int:
+        values = {
+            "I": 1,
+            "IV": 4,
+            "V": 5,
+            "IX": 9,
+            "X": 10,
+            "XL": 40,
+            "L": 50,
+            "XC": 90,
+            "C": 100,
+            "CD": 400,
+            "D": 500,
+            "CM": 900,
+            "M": 1000
+        }
+
+        doubles = ["IV", "IX", "XL", "XC", "CD", "CM"]
+
+        total = 0
+        i = 0
+        while i < len(s):
+            first_ = s[i]
+            second_ = s[i + 1] if i < len(s) - 1 else ''
+            if f'{first_}{second_}' in doubles:
+                total += values[f'{first_}{second_}']
+                i += 2 if i < len(s) - 1 else 1
+            else:
+                total += values[f'{first_}']
+                i += 1
+        return total
+
+
+if __name__ == '__main__':
+    sol = Solution()
+    print(sol.romanToInt("LVIII"))