Improved method signatures

Author: javadev

src/main/python/g0001_0100/s0001_two_sum/Solution.py

@@ -1,6 +1,6 @@
 # #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table
 # #Data_Structure_I_Day_2_Array #Level_1_Day_13_Hashmap #Udemy_Arrays #Big_O_Time_O(n)_Space_O(n)
-# #2024_06_03_Time_47_ms_(97.59%)_Space_17.7_MB_(38.78%)
+# #2024_06_06_Time_62_ms_(53.52%)_Space_17.8_MB_(37.79%)
 
 from typing import List
 
@@ -9,7 +9,7 @@ def twoSum(self, numbers: List[int], target: int) -> List[int]:
         index_map = {}
         for i, num in enumerate(numbers):
             required_num = target - num
-        if required_num in index_map:
-            return [index_map[required_num], i]
-        index_map[num] = i
+            if required_num in index_map:
+                return [index_map[required_num], i]
+            index_map[num] = i
         return [-1, -1]

src/main/python/g0001_0100/s0002_add_two_numbers/Solution.py

@@ -1,14 +1,14 @@
 # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Math #Linked_List #Recursion
 # #Data_Structure_II_Day_10_Linked_List #Programming_Skills_II_Day_15
-# #Big_O_Time_O(max(N,M))_Space_O(max(N,M)) #2024_06_03_Time_45_ms_(95.01%)_Space_16.7_MB_(8.91%)
+# #Big_O_Time_O(max(N,M))_Space_O(max(N,M)) #2024_06_06_Time_47_ms_(90.77%)_Space_16.6_MB_(83.79%)
 
 # Definition for singly-linked list.
 # class ListNode:
 #     def __init__(self, val=0, next=None):
 #         self.val = val
 #         self.next = next
 class Solution:
-    def addTwoNumbers(self, l1: ListNode, l2: ListNode) -> ListNode:
+    def addTwoNumbers(self, l1: Optional[ListNode], l2: Optional[ListNode]) -> Optional[ListNode]:
         dummy_head = ListNode(0)
         p, q, curr = l1, l2, dummy_head
         carry = 0
@@ -29,4 +29,3 @@ def addTwoNumbers(self, l1: ListNode, l2: ListNode) -> ListNode:
             curr.next = ListNode(carry)
 
         return dummy_head.next
-    

src/main/python/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.py

@@ -1,6 +1,6 @@
 # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Sliding_Window
 # #Algorithm_I_Day_6_Sliding_Window #Level_2_Day_14_Sliding_Window/Two_Pointer #Udemy_Strings
-# #Big_O_Time_O(n)_Space_O(1) #2024_06_03_Time_43_ms_(96.08%)_Space_16.5_MB_(92.45%)
+# #Big_O_Time_O(n)_Space_O(1) #2024_06_06_Time_45_ms_(93.32%)_Space_16.6_MB_(53.05%)
 
 class Solution:
     def lengthOfLongestSubstring(self, s: str) -> int:

src/main/python/g0001_0100/s0004_median_of_two_sorted_arrays/Solution.py

@@ -2,7 +2,7 @@
 # #Big_O_Time_O(log(min(N,M)))_Space_O(1) #2024_06_03_Time_63_ms_(99.35%)_Space_16.9_MB_(31.27%)
 
 class Solution:
-    def findMedianSortedArrays(self, nums1, nums2):
+    def findMedianSortedArrays(self, nums1: List[int], nums2: List[int]) -> float:
         if len(nums2) < len(nums1):
             return self.findMedianSortedArrays(nums2, nums1)
 

src/main/python/g0001_0100/s0008_string_to_integer_atoi/Solution.py

@@ -27,4 +27,4 @@ def myAtoi(self, s: str) -> int:
             elif result > 2**31 - 1:
                 return 2**31 - 1
             return result
-        return 0
+        return 0

src/main/python/g0001_0100/s0009_palindrome_number/Solution.py

@@ -2,4 +2,4 @@
 
 class Solution:
     def isPalindrome(self, x: int) -> bool:
-        return str(x) == str(x)[::-1]
+        return str(x) == str(x)[::-1]

src/main/python/g0001_0100/s0011_container_with_most_water/Solution.py

@@ -3,7 +3,7 @@
 # #2024_06_04_Time_488_ms_(91.81%)_Space_29.5_MB_(60.76%)
 
 class Solution:
-    def maxArea(self, height):
+    def maxArea(self, height: List[int]) -> int:
         max_area = -1
         left = 0
         right = len(height) - 1

src/main/python/g0001_0100/s0015_3sum/Solution.py

@@ -3,7 +3,7 @@
 # #Big_O_Time_O(n*log(n))_Space_O(n^2) #2024_06_04_Time_683_ms_(63.27%)_Space_20.8_MB_(49.61%)
 
 class Solution:
-    def threeSum(self, nums):
+    def threeSum(self, nums: List[int]) -> List[List[int]]:
         nums.sort()
         result = []
         length = len(nums)

src/main/python/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.py

@@ -3,7 +3,7 @@
 # #Big_O_Time_O(4^n)_Space_O(n) #2024_06_04_Time_28_ms_(91.85%)_Space_16.5_MB_(84.41%)
 
 class Solution:
-    def letterCombinations(self, digits):
+    def letterCombinations(self, digits: str) -> List[str]:
         if not digits:
             return []
 

src/main/python/g0001_0100/s0019_remove_nth_node_from_end_of_list/Solution.py

@@ -8,7 +8,7 @@
 #         self.val = val
 #         self.next = next
 class Solution:
-    def removeNthFromEnd(self, head, n):
+    def removeNthFromEnd(self, head: Optional[ListNode], n: int) -> Optional[ListNode]:
         self.n = n
         dummy = ListNode(0, head)
         self._removeNth(dummy)
@@ -23,20 +23,3 @@ def _removeNth(self, node):
 
         if self.n == 0:
             node.next = node.next.next
-
-# Helper function to create a linked list from a list
-def create_linked_list(lst):
-    dummy = ListNode(0)
-    current = dummy
-    for val in lst:
-        current.next = ListNode(val)
-        current = current.next
-    return dummy.next
-
-# Helper function to convert a linked list to a list
-def linked_list_to_list(node):
-    lst = []
-    while node:
-        lst.append(node.val)
-        node = node.next
-    return lst