Flexmoney Android Developer Interview Questions and Answers

The task is to find all anagrams of a given sub-string within a larger string.

• Iterate through the larger string and check for anagrams of the sub-string using a sliding window approach.

• Use a hashmap to store the frequency of characters in the sub-string and compare it with the frequency of characters in each window of the larger string.

• Return the indices of the starting positions of all anagrams found.