Improved python

Author: javadev

src/main/python/g0401_0500/s0416_partition_equal_subset_sum/Solution0416.py

@@ -1,6 +1,8 @@
 # #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Level_2_Day_13_Dynamic_Programming
 # #Big_O_Time_O(n*sums)_Space_O(n*sums) #2025_07_25_Time_564_ms_(63.45%)_Space_18.06_MB_(74.36%)
 
+from typing import List
+
 class Solution:
     def canPartition(self, nums: List[int]) -> bool:
         sums = sum(nums)

src/main/python/g0401_0500/s0437_path_sum_iii/Solution0437.py

@@ -2,6 +2,14 @@
 # #LeetCode_75_Binary_Tree/DFS #Level_2_Day_7_Tree #Big_O_Time_O(n)_Space_O(n)
 # #2025_07_26_Time_0_ms_(100.00%)_Space_18.23_MB_(71.00%)
 
+from typing import Optional
+
+class TreeNode:
+    def __init__(self, val=0, left=None, right=None):
+        self.val = val
+        self.left = left
+        self.right = right
+
 # Definition for a binary tree node.
 # class TreeNode:
 #     def __init__(self, val=0, left=None, right=None):

src/main/python/g0401_0500/s0438_find_all_anagrams_in_a_string/Solution0438.py

@@ -3,6 +3,7 @@
 # #Level_1_Day_12_Sliding_Window/Two_Pointer #Big_O_Time_O(n+m)_Space_O(1)
 # #2025_07_25_Time_54_ms_(54.80%)_Space_18.16_MB_(94.43%)
 
+from typing import List
 from collections import defaultdict
 
 class Solution:

src/main/python/g0401_0500/s0494_target_sum/Solution0494.py

@@ -1,6 +1,8 @@
 # #Medium #Array #Dynamic_Programming #Backtracking #Big_O_Time_O(n*(sum+s))_Space_O(n*(sum+s))
 # #2025_07_25_Time_59_ms_(77.59%)_Space_18.11_MB_(61.50%)
 
+from typing import List
+
 class Solution:
     def findTargetSumWays(self, nums: List[int], target: int) -> int:
         total_sum = sum(nums)

src/main/python/g0501_0600/s0543_diameter_of_binary_tree/Solution0543.py

@@ -2,6 +2,14 @@
 # #Udemy_Tree_Stack_Queue #Big_O_Time_O(n)_Space_O(n)
 # #2025_07_25_Time_3_ms_(94.30%)_Space_20.69_MB_(95.89%)
 
+from typing import Optional
+
+class TreeNode:
+    def __init__(self, val=0, left=None, right=None):
+        self.val = val
+        self.left = left
+        self.right = right
+
 # Definition for a binary tree node.
 # class TreeNode:
 #     def __init__(self, val=0, left=None, right=None):