Arjun Mehta1 month agoMost voted6
anti hash test. someone made inputs that all collide so every operation became O(n). use a custom hash (splitmix64 with a random seed) or just use map
same solution with map passed. how is O(log n) beating O(1)
2 answers
Tushar Goyal1 month ago2
map also gives sorted order and lower_bound, half the time that's why I use it anyway
Related questions
- 2answers 3votes printf("%d", sizeof('a')) output? quiz said 4 but char is 1 byte? C++aman khan·29 days ago
- 1answer 4votes sizeof a reference in C++? Quiz said sizeof(reference) gives the size of the referred type. I guessed it right but don't understand why. Does a reference take memory or not? C++Rahul Yadav·1 month ago
Want the full explanation, not just an answer?
Structured lessons on DSA, core CS, Java and interview skills, each ending in a quiz so you know it stuck.