DEV Community

loading...

Discussion on: Scala Daily Coding Problem #001

Collapse
rodiongork profile image
Rodion Gorkovenko • Edited

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 :)

Try filling list with 1 million random elements and you'll see what I mean...

Collapse
awwsmm profile image
Andrew (he/him) Author

Thanks for pointing that out! How would you solve this in a single pass?

Collapse
rodiongork profile image
Rodion Gorkovenko

Putting elements to HashSet and looking up for K-element... It will make O(N) solution.