Updated readme

Author: javadev

README.md

@@ -107,6 +107,8 @@ This code defines a `Solution` class with a `searchRange` method to find the sta
 ## Solution
 
 ```python
+from typing import List
+
 class Solution:
     def searchRange(self, nums: List[int], target: int) -> List[int]:
         ans = [-1, -1]

src/main/python/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/readme.md

@@ -109,6 +109,8 @@ This code defines a `Solution` class with a `searchInsert` method to find the in
 ## Solution
 
 ```python
+from typing import List
+
 class Solution:
     def searchInsert(self, nums: List[int], target: int) -> int:
         low = 0

src/main/python/g0001_0100/s0035_search_insert_position/readme.md

@@ -80,6 +80,8 @@ This implementation uses dynamic programming to efficiently calculate the minimu
 ## Solution
 
 ```python
+from typing import List
+
 class Solution:
     def minPathSum(self, grid: List[List[int]]) -> int:
         n = len(grid)

src/main/python/g0001_0100/s0064_minimum_path_sum/readme.md

@@ -87,6 +87,8 @@ This solution has a time complexity of O(m * n), where m is the number of rows a
 ## Solution
 
 ```python
+from typing import List
+
 class Solution:
     def setZeroes(self, matrix: List[List[int]]) -> None:
         """

src/main/python/g0001_0100/s0073_set_matrix_zeroes/readme.md

@@ -79,6 +79,8 @@ This solution has a time complexity of O(m + n), where m is the number of rows a
 ## Solution
 
 ```python
+from typing import List
+
 class Solution:
     def searchMatrix(self, matrix: List[List[int]], target: int) -> bool:
         endRow = len(matrix)

src/main/python/g0001_0100/s0074_search_a_2d_matrix/readme.md

@@ -98,6 +98,8 @@ This solution sorts the colors in-place using a one-pass algorithm with constant
 ## Solution
 
 ```python
+from typing import List
+
 class Solution:
     def sortColors(self, nums: List[int]) -> None:
         """

src/main/python/g0001_0100/s0075_sort_colors/readme.md

@@ -73,6 +73,7 @@ This solution generates all possible subsets using backtracking. It explores all
 
 ```python
 from itertools import combinations
+from typing import List
 
 class Solution:
     def subsets(self, nums: List[int]) -> List[List[int]]:

src/main/python/g0001_0100/s0078_subsets/readme.md

@@ -103,6 +103,9 @@ This solution explores all possible paths in the grid to find the word using bac
 ## Solution
 
 ```python
+from typing import List
+from collections import Counter
+
 class Solution:
     def exist(self, board: List[List[str]], word: str) -> bool:
         n = len(board)
@@ -116,7 +119,8 @@ class Solution:
             c = Counter()
             for line in board:
                 c.update(line)
-            return Counter(word) <= c
+            w = Counter(word)
+            return all(c[ch] >= count for ch, count in w.items())
 
         if not is_sub(board, word):
             return False

src/main/python/g0001_0100/s0079_word_search/readme.md

@@ -72,6 +72,8 @@ This solution efficiently finds the largest rectangle area in the histogram usin
 ## Solution
 
 ```python
+from typing import List
+
 class Solution:
     def largestRectangleArea(self, heights: List[int]) -> int:
         lefts = [0]