few ready

Author: OfficialCodeVoyage

136 Single Number/solution.py

@@ -0,0 +1,40 @@
+# Given a non-empty array of integers nums, every element appears twice except for one. Find that single one.
+#
+# You must implement a solution with a linear runtime complexity and use only constant extra space.
+
+# Example 1:
+#
+# Input: nums = [2,2,1]
+# Output: 1
+# Example 2:
+#
+# Input: nums = [4,1,2,1,2]
+# Output: 4
+# Example 3:
+#
+# Input: nums = [1]
+# Output: 1
+
+
+nums = [4, 1, 2, 1, 2]
+
+
+def checknums(nums) -> int:
+
+    #dict style
+    emtpy_dic = {}
+    count = 0
+    for i in nums:
+        if i in emtpy_dic:
+            emtpy_dic[i] += 1
+        else:
+            emtpy_dic[i] = 1
+    # print(emtpy_dic)
+
+
+    for k,v in emtpy_dic.items():
+        if v == 1:
+            return k
+
+
+print(checknums(nums))

20 Valid Parentheses/solution.py

@@ -0,0 +1,31 @@
+# Given a string s containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.
+#
+# An input string is valid if:
+#
+# Open brackets must be closed by the same type of brackets.
+# Open brackets must be closed in the correct order.
+# Every close bracket has a corresponding open bracket of the same type.
+#
+#
+# Example 1:
+#
+# Input: s = "()"
+#
+# Output: true
+
+
+s = "([])"
+
+
+def main(s) -> bool:
+    stor = {
+        "]" : "[",
+        "}" : "{",
+        ")" : "("
+    }
+    stack = []
+
+
+
+
+print(main(s))

268 Missing Number/solution.py

@@ -0,0 +1,27 @@
+# Given an array nums containing n distinct numbers in the range [0, n], return the only number in the range that is missing from the array.
+#
+#
+#
+# Example 1:
+#
+# Input: nums = [3,0,1]
+# Output: 2
+# Explanation: n = 3 since there are 3 numbers, so all numbers are in the range [0,3]. 2 is the missing number in the range since it does not appear in nums.
+
+
+nums = [3, 0, 1]
+
+def missingnum(nums) -> int:
+
+    list1 = []
+
+    for i in range(0, len(nums)+1):
+        list1.append(i)
+    # print(list1)
+
+    for i in list1:
+        if i not in nums:
+            return i
+
+
+print(missingnum(nums))

58 Length of Last Word/solution.py

@@ -0,0 +1,37 @@
+# Given a string s consisting of words and spaces, return the length of the last word in the string.
+#
+# A word is a maximal
+# substring
+#  consisting of non-space characters only.
+#
+# Example 1:
+#
+# Input: s = "Hello World"
+# Output: 5
+# Explanation: The last word is "World" with length 5.
+# Example 2:
+#
+# Input: s = "   fly me   to   the moon  "
+# Output: 4
+# Explanation: The last word is "moon" with length 4.
+# Example 3:
+#
+# Input: s = "luffy is still joyboy"
+# Output: 6
+# Explanation: The last word is "joyboy" with length 6.
+#
+
+s = "   fly me   to   the moon  "
+
+def func(s) -> int:
+    lis = s.split(" ")
+    final_list = []
+
+    for i in lis:
+        if i.isalpha():
+            final_list.append(i)
+
+    return len(final_list[-1])
+
+
+print(func(s))