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.
Tough challenge if you chose C or otherwise avoided pre-defined map structures! In C it required a highly optimised, sorted map with binary insert and binary search to avoid timeout. Even shuffling entries had to be done with memmove instead of a for loop. A lot harder than I was expecting!
Goes to show the power of the standard template libraries.
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 →
Tough challenge if you chose C or otherwise avoided pre-defined map structures! In C it required a highly optimised, sorted map with binary insert and binary search to avoid timeout. Even shuffling entries had to be done with memmove instead of a for loop. A lot harder than I was expecting!
Goes to show the power of the standard template libraries.