softpasswords

Soft Passwords

ID: softpasswords

Difficulty: 2.4

CPU Time: 1 second

Memory: 1024 MB

Solution

For this, one can simple check if S == P, then generate every possible permutation of P (prepending/appending digits, converting the case of P) and compare with S to see if any match (either storing them all and checking at the end, or checking as you go) and if there is a match, output "Yes".