Solution (leetcode-in-java 1.20 API)

java.lang.Object
- g0501_0600.s0567_permutation_in_string.Solution

```
public class Solution
extends Object
```
567 - Permutation in String.
Medium

Given 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 the substring of s2.

Example 1:

Input: s1 = “ab”, s2 = “eidbaooo”

Output: true

Explanation: s2 contains one permutation of s1 (“ba”).

Example 2:

Input: s1 = “ab”, s2 = “eidboaoo”

Output: false

Constraints:
- 1 <= s1.length, s2.length <= 10⁴
- s1 and s2 consist of lowercase English letters.

- Constructor Summary
  
  Constructors
  Constructor Description
  
  Solution()
- Method Summary
  
  All Methods Instance Methods Concrete Methods
  Modifier and Type Method Description
  
  boolean checkInclusion(String s1, String s2)
  - Methods inherited from class java.lang.Object
    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail
- Solution
```
public Solution()
```

Method Detail

checkInclusion

public boolean checkInclusion(String s1,
                              String s2)