# Permutation In String: Study Guide

Permutation In String shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Same sliding need-count as anagrams: a window of length len(s1) inside s2 is a permutation when all counts match.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (two pointers, a sliding window, prefix sums, a monotonic stack, or binary search on the answer) and why a linear nested scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(n).

## Common mistake

Generating every permutation of s1 and searching, which is factorial.

## Practice tip

Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at interview copilot app.