Back to course home
0% completed
Solution: Problem Challenge 1: Permutation in a String
Problem Statement
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:
- abc
- acb
- bac
- bca
- cab
- cba
If a string has ‘n’ distinct characters, it will have n! permutations.
Example 1:
Input: str="oidbcaf", pattern="ABC"
Output: true
Explanation: The string contains "bca" which is a permutation of the given pattern.
Example 2:
Input: str="odicf", pattern="dc"
.....
.....
.....
Like the course? Get enrolled and start learning!