We're a place where coders share, stay up-to-date and grow their careers.
Andrew, Hi!
This problem is often at interviews, I dare say, so be careful :)
Your final solution with combinations and exists is definitely not one pass. It is N*N but wrapped in thin layer of deceiving FP style :)
combinations
exists
N*N
Try filling list with 1 million random elements and you'll see what I mean...
Thanks for pointing that out! How would you solve this in a single pass?
Putting elements to HashSet and looking up for K-element... It will make O(N) solution.
Andrew, Hi!
This problem is often at interviews, I dare say, so be careful :)
Your final solution with
combinationsandexistsis definitely not one pass. It isN*Nbut wrapped in thin layer of deceiving FP style :)Try filling list with 1 million random elements and you'll see what I mean...
Thanks for pointing that out! How would you solve this in a single pass?
Putting elements to HashSet and looking up for K-element... It will make O(N) solution.