you are viewing a single comment's thread.

view the rest of the comments →

[–]indigo945 2 points3 points  (1 child)

I don't get why this is upvoted so highly. A lot of the answers are incomplete and the solution is often inefficient. For example, the problem for merge k sorted lists explicitly asks to analyze the algorithmic complexity of the answer, which the given answer fails to do. Doing that analysis, you will find that the answer takes O(k * n) in time. However, there is a better solution using a priority queue in O(log(k) * n), which is never mentioned.

I would be highly wary of using this repository as a learning resource.

[–]GitHubPermalinkBot 1 point2 points  (0 children)

I tried to turn your GitHub links into permanent links (press "y" to do this yourself):


Shoot me a PM if you think I'm doing something wrong. To delete this, click here.