New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Space complexity mismatch in Space Edition! #1

Open

AkshayGosree opened this issue Aug 17, 2017 · 0 comments

AkshayGosree commented Aug 17, 2017 •

edited

Loading

dev/code-practice/interview-cake/src/com/danialgoodwin/interviewcake/question/FindDuplicateOptimizeForSpace.java

Line 52 in e65e91c

Collections.sort(numbers);

This code will internally call the legacy merge sort which will take an O(n) space complexity.

So I think your code would take more than O(1) space! :)

AkshayGosree changed the title ~~Time complexity mismatch~~ Space complexity mismatch in Space Edition!

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment