A while ago a lost SO user posted a question here and its now been deleted but I think it would make a good challenge so here it goes...
Write a full program or function that takes two strings and checks whether any permutation of the first string is a sub-string of the second string.
Two strings, a string and a sub-string to test for (you may choose the order).
A truthy value if the string contains any permutation of the sub-string.
A falsey value if the string does not contain any permutations of the the sub-string.
The test is case sensitive.
sub-string string input d!rl Hello World! output truthy input Pog Programming Puzzles & Code Golf output falsey input ghjuyt asdfhytgju1234 output truthy