Hi Yu Chen, that's a really good point. You're correct, being able to sort the hash map actually comes with the tradeoff that you're storing the pairs in a list, so the lookup time changes to O(N). I'll update the article with that note. =)