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.
The reason you want to use a map or something like it is because a map has constant time insertion and lookup. This makes your algortihm using a map for this O(n). Any sorting algorithm will be O(nlogn) so it has a slower runtime.
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Hash Tables: Ransom Note
You are viewing a single comment's thread. Return to all comments →
The reason you want to use a map or something like it is because a map has constant time insertion and lookup. This makes your algortihm using a map for this O(n). Any sorting algorithm will be O(nlogn) so it has a slower runtime.