LeetCode - 150 - Permutation in String
The problem Given two strings s1 and s2, return true if s2 contains a permutation of s1, or false otherwise. A permutation is a rearrangement of all the characters of a string. In other words, return true if one of s1’s permutations is a substring of s2. Examples Input: s1 = "ab", s2 = "eidbaooo" Output: true Explanation: s2 contains one permutation of s1 ("ba"). Input: s1 = "ab", s2 = "eidboaoo" Output: false Constraints 1 <= s1.length, s2.length <= 10^4 s1 and s2 consist of lowercase English letters. Explanation Before we jump into the solution, let’s take a look at the example with input s1 = "ab", s2 = "eidbaooo" We are looking for a permutation of s1 in s2 with the size of s1. In the example, we can see that we have a permutation of s1 = "ab" in s2 = "eidbaooo" but in a different order. ...