Revolut Interview Question
What is the time complexity of reading a HashMap
Interview Answer
Anonymous
Aug 26, 2025
generally O(1), but more specifically - it's the number of collisions for given key has, that needs to be searched
1
What is the time complexity of reading a HashMap
Anonymous
generally O(1), but more specifically - it's the number of collisions for given key has, that needs to be searched
Check out your Company Bowl for anonymous work chats.