2 unsolved

Author: OfficialCodeVoyage

13_Roman to Integer/solution.py

@@ -0,0 +1,72 @@
+# Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M.
+#
+# Symbol       Value
+# I             1
+# V             5
+# X             10
+# L             50
+# C             100
+# D             500
+# M             1000
+# For example, 2 is written as II in Roman numeral, just two ones added together. 12 is written as XII, which is simply X + II. The number 27 is written as XXVII, which is XX + V + II.
+#
+# Roman numerals are usually written largest to smallest from left to right. However, the numeral for four is not IIII. Instead, the number four is written as IV. Because the one is before the five we subtract it making four. The same principle applies to the number nine, which is written as IX. There are six instances where subtraction is used:
+#
+# I can be placed before V (5) and X (10) to make 4 and 9.
+# X can be placed before L (50) and C (100) to make 40 and 90.
+# C can be placed before D (500) and M (1000) to make 400 and 900.
+# Given a roman numeral, convert it to an integer.
+#
+#
+#
+# Example 1:
+#
+# Input: s = "III"
+# Output: 3
+# Explanation: III = 3.
+# Example 2:
+#
+# Input: s = "LVIII"
+# Output: 58
+# Explanation: L = 50, V= 5, III = 3.
+# Example 3:
+#
+# Input: s = "MCMXCIV"
+# Output: 1994
+# Explanation: M = 1000, CM = 900, XC = 90 and IV = 4.
+#
+
+s = "LII"
+
+greeksymbols = {
+    "I" : 1,
+    "V" : 5,
+    "X" : 10,
+    "L" : 50
+          }
+
+
+def RtoI(roman) -> int:
+    listnumbers = [i for i in roman]
+    sum = 0
+    pointer1, pointer2 = 0, 1
+
+    while pointer1 < (len(listnumbers) - 1):
+        current_val = greeksymbols[listnumbers[pointer1]]
+        next_val = greeksymbols[listnumbers[pointer2]]
+        if int(current_val) < int(next_val):
+            sum -= int(next_val) - int(current_val)
+            pointer1 += 2
+            pointer2 += 2
+        else:
+            sum += int(current_val)
+            pointer1 += 1
+            pointer2 += 1
+
+    if pointer1 == len(listnumbers) - 1:
+        sum += greeksymbols[listnumbers[pointer1]]
+
+    return sum
+
+
+print(RtoI(s))

392_Is Subsequence/solution.py

@@ -0,0 +1,44 @@
+# Given two strings s and t, return true if s is a subsequence of t, or false otherwise.
+#
+# A subsequence of a string is a new string that is formed from the original string by deleting some
+# (can be none) of the characters without disturbing the relative positions of the remaining characters.
+# (i.e., "ace" is a subsequence of "abcde" while "aec" is not).
+#
+#
+#
+# Example 1:
+#
+# Input: s = "abc", t = "ahbgdc"
+# Output: true
+# Example 2:
+#
+# Input: s = "axc", t = "ahbgdc"
+# Output: false
+#
+s, t = "bb", "ahbgcd"
+
+
+def check(s, t) -> bool:
+    list1 = [i for i in s] # b b
+    list2 = [i for i in t] # a h b g c d
+
+    po1, po2 = 0, 0
+    stop = list2[-1]
+
+    if len(list1) == 0:
+        return False
+
+    while po1 < len(list1):
+        if list1[po1] == list2[po2]:
+            po1 += 1
+
+        elif list2[po2] == stop:
+            return False
+        po2 += 1
+
+    return True
+
+
+
+
+print(check(s, t))

practice_small_code.ipynb

@@ -26,6 +26,41 @@
     }
    ],
    "execution_count": 2
+  },
+  {
+   "metadata": {
+    "ExecuteTime": {
+     "end_time": "2024-08-07T03:39:46.132609Z",
+     "start_time": "2024-08-07T03:39:46.128540Z"
+    }
+   },
+   "cell_type": "code",
+   "source": [
+    "s = \"bb\"\n",
+    "list1 = [i for i in s]\n",
+    "print(len(list1) -1 ) \n",
+    "print(len(list1))"
+   ],
+   "id": "74d716e94aa6f339",
+   "outputs": [
+    {
+     "name": "stdout",
+     "output_type": "stream",
+     "text": [
+      "1\n",
+      "2\n"
+     ]
+    }
+   ],
+   "execution_count": 6
+  },
+  {
+   "metadata": {},
+   "cell_type": "code",
+   "outputs": [],
+   "execution_count": null,
+   "source": "",
+   "id": "282cf3c329427e88"
   }
  ],
  "metadata": {