Re:Show HN: Anonymous interview evals of strong software/ML ...
by pradeep_m on Monday July 31, 2017 @06:52PM
(#14896561)
I think the code is written for the case where it fits in memory. For that case, the solution is O(n) in terms of time complexity. From the feedback it seems that they only spoke about the solution where the data doesn't fit in memory.
[ Parent
| on HN ]
Re:Show HN: Anonymous interview evals of strong software/ML ...
by drfuchs on Monday July 31, 2017 @07:22PM
(#14896725)
"To test further, I asked her how she will approach the problem if the array was too big to fit in
memory ... She then worked on adapting
her original code to work with left and right batches, swapping ... back to disk." (Emphasis mine.)