Find all anagrams of a given string

In this article, we have explained efficient algorithms to Find all anagrams of a given string. This involve techniques like sliding window approach.

Table of Contents1)Problem statement2)Naive approach3)Sliding Window approach4)Conclusion

An anagram of a word is that which is formed by rearranging the letters of the word in some order.

For example,

Some of the anagrams of the word "abcd" are "abdc","bdac","cabd","acdb"....

1)Problem statement

Given two strings s1 and s2. Fi...