LEETCODE
UNLOCKED
Problems
Donate
Premium
Minimum Window Substring
Solution Code
Time Complexity
O(
M + N
)
where M is the length of s and N is the length of t.
Space Complexity
O(
K
)
where K is the number of unique characters in t (at most
O(
1
)
if the character set size is fixed).
