All problemsBack
Permutation in String
mediumGiven two strings s1 and s2, return true if s2 contains a permutation of s1, or false otherwise.
In other words, return true if one of s1's permutations is a substring of s2.
Test Cases
Copy an input into themain harness and Run to verifyInput
s1 = "ab", s2 = "eidbaooo"Expected Output
trueExplanation: s2 contains one permutation of s1 ("ba").
Input
s1 = "ab", s2 = "eidboaoo"Expected Output
falseConstraints
- 1 <= s1.length, s2.length <= 10^4
- s1 and s2 consist of lowercase English letters.
Hints
Hint 1 — click to reveal
A permutation has exactly the same letter counts — order is irrelevant.
Hint 2 — click to reveal
Slide a fixed-size window of length s1.length() across s2 and compare counts.
Java Compiler
Powered by OneCompiler. Starter code loads automatically — edit and hit Run.