# Minimum Window Subsequence (LC5250)

## Problem
Interview classic: Minimum Window Subsequence.

## Approach
Two-pointer / DP for shortest window of S containing T as subsequence.

## Complexity
Time/space depend on constraints; aim for the optimal DP/graph solution above.

## Practice tip
Walk through a small example out loud, state invariants, then code.

Practice with [Linkjob AI copilot](https://www.linkjob.ai/).
