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.
This how i approached:
1. Generated all Subsequence of the String and stored in a List.
2. Sorted the Strings in the list alphabetically
3. Find Equality of the same strings
4. Time Complexity: O(n^2)
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 →
This how i approached: 1. Generated all Subsequence of the String and stored in a List. 2. Sorted the Strings in the list alphabetically 3. Find Equality of the same strings 4. Time Complexity: O(n^2)