I solved this problem given to me in an interview, but I do not know what the Time Space complexity is. What is the Time Space complexity of the following solution? I think it might be O(log(n)) or is it simple O(n)? Answer Your solution uses a characteristic of JavaScript objects: keys that are decimal representations of indexes will be