Loading your interview setup

Skip to content

Overview Resume Score

Practice

The Daily LarpCode Reps LarpTalk

Interview

Templates Sessions

recent

Loading

medium· sliding-window Mock interview

Permutation in String

Given two strings `s1` and `s2`, return true if `s2` contains a substring that is a permutation of `s1` (the same letters with the same counts, in any order).

Examples

in: s1 = "ab", s2 = "eidbaooo"

out: true

"ba" is a permutation of "ab"

Constraints

1 <= len(s1), len(s2) <= 10^4
lowercase letters

Hints

target: O(len(s2)) time⌘↩ run · ⇧⌘↩ submit