This program is the solution for below problem.
Problem: Given two strings S and T, find out whether any anagram of T is a Substring of S.
Definition Anagram: Any permutation of string - eg. "leg,gel,egl,elg" are all anagrams Substring: Continuous sequence of characters of a string Goo is a substring of Google but Gog is not.
Example: A = Google, B = Gog Answer: False A= Google, B = Goo Answer: True A=Google, B = Got Answer: False