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.
Hint : The problem boils down to writing an acceptable hash method for anagramic strings. The last test case will fail with naive hash methods. Despite the same O(n) complexity for both methods, it makes a huge difference 2+s vs 0.64s.
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Project Euler #98: Anagramic squares
You are viewing a single comment's thread. Return to all comments →
Hint : The problem boils down to writing an acceptable hash method for anagramic strings. The last test case will fail with naive hash methods. Despite the same O(n) complexity for both methods, it makes a huge difference 2+s vs 0.64s.