Added solutions by Saumya Agrahari

submissions/SaumyaAgrahari/question1/solution1

@@ -0,0 +1,23 @@
+class Solution:
+    def romanToInt(self, s):
+        roman = {
+            'I': 1,
+            'V': 5,
+            'X': 10,
+            'L': 50,
+            'C': 100,
+            'D': 500,
+            'M': 1000
+        }
+
+        total = 0
+
+        for i in range(len(s)):
+            # If next symbol is larger, subtract current; else, add it
+            if i + 1 < len(s) and roman[s[i]] < roman[s[i + 1]]:
+                total -= roman[s[i]]
+            else:
+                total += roman[s[i]]
+
+        return total
+

submissions/SaumyaAgrahari/question2/solution2

@@ -0,0 +1,12 @@
+class Solution:
+    def strStr(self, haystack, needle):
+        len_h = len(haystack)
+        len_n = len(needle)
+        if len_n == 0:
+            return 0
+
+        for i in range(len_h - len_n + 1):
+            if haystack[i:i + len_n] == needle:
+                return i
+
+        return -1