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.
I didn't use a hashmap. I coded the logic for possible combinations using repeated chars (in pairs) and the distance between them (and to the right of the second without reaching a new repetition of the same char).
Sherlock and Anagrams
You are viewing a single comment's thread. Return to all comments →
I didn't use a hashmap. I coded the logic for possible combinations using repeated chars (in pairs) and the distance between them (and to the right of the second without reaching a new repetition of the same char).