Permutation in String

Medium

Topics
StringSliding WindowHash Table

Given two strings s1 and s2, return true if s2 contains a permutation of s1 as a contiguous substring. (Here the first line is s1, the second is s2.)

Example 1

Input:  s1 = "ab", s2 = "eidbaooo"
Output: true

Example 2

Input:  s1 = "ab", s2 = "eidboaoo"
Output: false

Constraints

  • 1 <= s1.length, s2.length <= 10^4
  • s1 and s2 consist of lowercase English letters.
Run ⌘' · Submit ⌘⏎