Solution Review: Problem Challenge 1

Permutation in a String (hard)

Given a string and a pattern, find out if the string contains any permutation of the pattern.

Permutation is defined as the re-arranging of the characters of the string. For example, “abc” has the following six permutations:

1. abc
2. acb
3. bac
4. bca
5. cab
6. cba

If a string has ‘n’ distinct characters, it will have $n!$ permutations.

Example 1:

Input: String="oidbcaf", Pattern="abc"
Output: true
Explanation: The

...