Update 0076-minimum-window-substring.py

The Leetcode description for the problem states:

m == s.length
n == t.length
1 <= m, n <= 10^5


Which means t == "" will never be True.

But what would make sense if m < n => return "", because then we cant find a minimum window substring.

Author: NiklasKK

python/0076-minimum-window-substring.py

@@ -1,6 +1,6 @@
 class Solution:
     def minWindow(self, s: str, t: str) -> str:
-        if t == "":
+        if len(s) < len(t):
             return ""
 
         countT, window = {}, {}