Minimum window Substring AND longest Substring with at most K distinct characters

Update: 2020-10-12

Description

Give a string S and a String T, find the minimum window in S which will contain all characters in T.

Comments

In Channel

Design In-Memory file system

2020-10-1409:54

Design Tic Tac Toe - Leetcode

2020-10-0708:00

SQL Processing order

2020-09-2203:56

Learn what are joins in SQL

2020-09-1907:15

Rotting oranges

2020-11-1006:29

Number of islands

2020-11-0504:14

Breadth first search and depth first search

2020-11-0503:19

Merge K Sorted Lists

2020-11-0507:58

Two sum, Two Sum - II, Three sum

2020-11-0505:35

Simplify Path

2020-10-1505:32

Minimum window Substring AND longest Substring with at most K distinct characters

2020-10-1205:36

Employee Free Time or Free intervals.

2020-10-1105:09

Find the celebrity

2020-10-0703:22

Meeting rooms - II

2020-10-0604:02

Leetcode: Verify Alien Dictionary

2020-09-1404:29

00:00

1.0x

#box-pro-ellipsis-176568033938683{-webkit-line-clamp:2;}Minimum window Substring AND longest Substring with at most K distinct characters