We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
My Solution:
- Define an array 'subarrs' to store all words(subarrays) of a given size
- Compare alll of them and check if they are anagrams
Repeat this step for all possible subarrays sizes
PYTHON
`
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Sherlock and Anagrams
You are viewing a single comment's thread. Return to all comments →
My Solution: - Define an array 'subarrs' to store all words(subarrays) of a given size - Compare alll of them and check if they are anagrams Repeat this step for all possible subarrays sizes
PYTHON `