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 find it too hard to find a way that basically worked, O = n^3 (due to n^2 / 2 comparisions which are inividually linear) -- but find myself at a total loss to find an efficient way that doesn't fail some tests by timing out. I hate the way some of these problems can make me feel dumb.
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 →
I didn't find it too hard to find a way that basically worked, O = n^3 (due to n^2 / 2 comparisions which are inividually linear) -- but find myself at a total loss to find an efficient way that doesn't fail some tests by timing out. I hate the way some of these problems can make me feel dumb.