14

Author: OfficialCodeVoyage

14 Longest Common Prefix/solution.py

@@ -15,25 +15,24 @@
 # Explanation: There is no common prefix among the input strings.
 #
 #
-strs = ["flower", "flow", "flight"]
+strs = ["flower", "flow", "floight"]
 
 
 # strs = ["dog","racecar","car"]
 
 def longest(strs) -> str:
-    str_answer = ''
+    prefix = strs[0]  #flower
+    answer = ""
     po1 = 0
-    lenght = len(strs)
-    m = min(len(s) for s in strs)
 
-    while po1 < m:
-        store = ''
-        for i in strs:
-            if strs[i][po1] != strs[0][po1]:
-                break
-            else:
-                str_answer += strs[i][po1]
+    for i in prefix:
+        for j in range(1, len(strs)):
+            if po1 >= len(strs[j]) or i != strs[j][po1]:
+                return answer
+        answer += i
         po1 += 1
 
+    return answer
+
 
 print(longest(strs))

66 Plus One/solution.py

@@ -0,0 +1,46 @@
+# You are given a large integer represented as an integer array digits, where each digits[i] is the ith digit of the integer. The digits are ordered from most significant to least significant in left-to-right order. The large integer does not contain any leading 0's.
+#
+# Increment the large integer by one and return the resulting array of digits.
+#
+#
+#
+# Example 1:
+#
+# Input: digits = [1,2,3]
+# Output: [1,2,4]
+# Explanation: The array represents the integer 123.
+# Incrementing by one gives 123 + 1 = 124.
+# Thus, the result should be [1,2,4].
+
+digits = [9, 9, 9]
+
+
+def plusone(digits) -> []:
+    # st = ""
+    # for i in digits:
+    #     st += str(i)
+    # answer = int(st) + 1
+    # answer1 = [int(i) for i in str(answer)]
+    # return answer1
+
+    digits.reverse()
+
+    one, i = 1, 0
+
+    while one:
+        if i < len(digits):
+            if digits[i] == 9:
+                digits[i] = 0
+            else:
+                digits[i] += 1
+                one = 0
+
+        else:
+            digits.append(1)
+            one = 0
+
+        i += 1
+
+    return digits[::-1]
+
+print(plusone(digits))

practice_small_code.ipynb

@@ -126,6 +126,35 @@
     }
    ],
    "execution_count": 1
+  },
+  {
+   "metadata": {
+    "ExecuteTime": {
+     "end_time": "2024-09-05T01:04:48.778648Z",
+     "start_time": "2024-09-05T01:04:48.771965Z"
+    }
+   },
+   "cell_type": "code",
+   "source": [
+    "string = \"1231\"\n",
+    "\n",
+    "for i in string:\n",
+    "    print(i)"
+   ],
+   "id": "4484b5192a9f57db",
+   "outputs": [
+    {
+     "name": "stdout",
+     "output_type": "stream",
+     "text": [
+      "1\n",
+      "2\n",
+      "3\n",
+      "1\n"
+     ]
+    }
+   ],
+   "execution_count": 1
   }
  ],
  "metadata": {