leetcode

76. Minimum Window Substring

Solution

• Python code
• Java code

Time complexity: O(m + n)

k = |alphabet| = 128

Space complexity: O(k)