Merge branch 'main' into GO

Author: AldythNahak

Easy/palindrome_number.py

@@ -0,0 +1,12 @@
+class Solution(object):
+    def isPalindrome(self, x):
+        """
+        :type x: int
+        :rtype: bool
+        """
+        strX = str(x)
+        return strX == strX[::-1]
+    
+print(Solution().isPalindrome(121)) #true
+print(Solution().isPalindrome(-121)) #false
+print(Solution().isPalindrome(10)) #false

Easy/two_sum.py

@@ -0,0 +1,19 @@
+class Solution(object):
+    def twoSum(self, nums, target):
+        """
+        :type nums: List[int]
+        :type target: int
+        :rtype: List[int]
+        """
+        lists = {}
+        for i, n in enumerate(nums):
+            s = target - n
+            if s in lists:
+                return [lists[s], i]
+            
+            lists[n] = i
+        
+print(Solution().twoSum([2,7,11,15], 9)) #[0, 1]
+print(Solution().twoSum([3,2,4], 6)) #[1, 2]
+print(Solution().twoSum([3,3], 6)) #[0, 1]
+print(Solution().twoSum([-3,4,3,90], 0)) #[0, 2]

Hard/median_of_two_sorted_arrays.py

@@ -0,0 +1,27 @@
+class Solution(object):
+    def findMedianSortedArrays(self, nums1, nums2):
+        """
+        :type nums1: List[int]
+        :type nums2: List[int]
+        :rtype: float
+        """
+        if len(nums1) > 1000 or len(nums2) > 1000:
+            return None
+        
+        joinArr = sorted(nums1 + nums2)
+        lenJoinArr = len(joinArr)
+        
+        if lenJoinArr == 0 or lenJoinArr > 2000:
+            return None
+        
+        mid = lenJoinArr // 2
+        if lenJoinArr % 2 == 1:
+            return float(joinArr[mid])
+        else:
+            return (joinArr[mid - 1] + joinArr[mid]) / 2.0
+        
+        
+        
+        
+print(Solution().findMedianSortedArrays([1,3], [2]))
+print(Solution().findMedianSortedArrays([1,2], [3,4]))

Medium/add_two_numbers.py

@@ -0,0 +1,32 @@
+# Definition for singly-linked list.
+class ListNode(object):
+    def __init__(self, val=0, next=None):
+        self.val = val
+        self.next = next
+        
+class Solution(object):
+    def addTwoNumbers(self, l1, l2):
+        node = ListNode()
+        current = node
+        carry = 0
+
+        while l1 or l2 or carry:
+            val1 = l1.val if l1 else 0
+            val2 = l2.val if l2 else 0
+
+            s = val1 + val2 + carry
+            carry = s // 10
+            current.next = ListNode(s % 10)
+            current = current.next
+
+            if l1:
+                l1 = l1.next
+
+            if l2:
+                l2 = l2.next
+
+        return node.next
+    
+print(Solution().addTwoNumbers([2, 4, 3], [5, 6, 4]))
+print(Solution().addTwoNumbers([9, 9, 9, 9, 9, 9, 9], [9, 9, 9, 9]))
+print(Solution().addTwoNumbers([0], [0]))