leetcode

76. Minimum Window Substring

Solution code

_n =

s

_

_m =

t

_

Time complexity: O(m + n)

_k =

alphabet

= 128_

Space complexity: O(k)