Space complexity mismatch in Space Edition!

[AkshayGosree]

https://github.com/danialgoodwin/dev/blob/e65e91cb5df8d63e2c1a24a692c506b64858228b/code-practice/interview-cake/src/com/danialgoodwin/interviewcake/question/FindDuplicateOptimizeForSpace.java#L52

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