We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
You are kidding about O(1) space right? Allocating O(N) space for this problem is completely unnecessary. Up to O(2 * m) is enough.
It's like saying that you can sort any sequence of non-repeating numbers in O(N) time by "only" using O(MaxValue) space. Yes you can, but is it worth allocating Gigabytes for sorting 100 numbers?
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Array Manipulation
You are viewing a single comment's thread. Return to all comments →
You are kidding about O(1) space right? Allocating O(N) space for this problem is completely unnecessary. Up to O(2 * m) is enough.
It's like saying that you can sort any sequence of non-repeating numbers in O(N) time by "only" using O(MaxValue) space. Yes you can, but is it worth allocating Gigabytes for sorting 100 numbers?