Back to all patterns

Two Pointers / Sliding Window

1 problems • Practice on LeetCode to earn credits

About This Pattern

Master the Two Pointers / Sliding Window pattern by practicing these problems organized by difficulty.Focus on the Key Signals - these are the indicators that tell you when to use this pattern.

Hard (1)

Minimum Window Subsequence

Find the minimum window in S which will contain all characters in T as a subsequence.

Key Signals:

Subsequence not substringMinimize windowTwo pointers