Leetcode 76 Minimum Window Substring 最小窗口子串
Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n). Example: Input: S = “ADOBECODEBANC”, T = “ABC” Output: “BANC” Note: If there is no such window in S that …

![[Storage System] High Level Overview and Perofrmance Metrics](https://i0.wp.com/52.205.168.20/wp-content/uploads/2018/09/ss1-1.png?resize=470%2C348)
![[DatabaseSystem] Advanced SQL](https://i0.wp.com/52.205.168.20/wp-content/uploads/2018/09/db1.png?resize=760%2C400)