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.
I'm curious what you mean by sorted map here. Did you have to keep the keys sorted for some reason? Insertion and retrieval from most map implementions are supposed to be O(1) ( amortized, of course, since rehashing will happen ).
I used Java's basic HashMap impl and passed in plenty of time. Java is not particularly fast, so a C map done correctly should have crushed this one.
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Day 8: Dictionaries and Maps
You are viewing a single comment's thread. Return to all comments →
I'm curious what you mean by sorted map here. Did you have to keep the keys sorted for some reason? Insertion and retrieval from most map implementions are supposed to be O(1) ( amortized, of course, since rehashing will happen ).
I used Java's basic HashMap impl and passed in plenty of time. Java is not particularly fast, so a C map done correctly should have crushed this one.