Joined May 2014
·
Posted to
Given a list of n integers, write a function to determine if any two sum to k
over 1 year
ago
I don't understand how III can be Pref O(n).
I think it would be O(n^2) or maybe O(nlgn). The second loop is hidden in the search for the (k-elem) element in the S set. This second loop would take O(n) or at best O(lgn) time depending on how the code was written by the system programmers (straight for loop or binary hash).
What am I missing?
Posted to
Create a "Heart" using CSS
over 1 year
ago
That was fun to do!
Thank
Great Article!
I was in an early stage and loved it. I was sad when it folded.
Now I am with a growth business and it is just as much fun.
My company (TQL) realizes that IT is a multiplier to their growth and not a cost to be controlled. I think this attitude makes a world of difference in the place that you work.