News for hackers. Stuff that matters.
Re:A Google Interviewing Story by jules on Saturday November 20, 2010 @06:53AM (#1924376)
So, the resulting algorithm would be O(n^2) not O(n) where n is the length of the string. The table based solution is exactly like keeping the exponents in an array.

There are no comments on this comment yet.