If you like saving time, you will get along well with Hashing techniques. Consider the simplest example of the birthday problem – given a day and a month – you need to look up the name of a person who has a birthday on that date. For simplicity, let us assume that there are only 365 people in our data set and each one has a unique birthday. The LinkedList Solution: If you were to use a linked list to store each person’s name and birthdate, you would have to visit an average of 183 nodes to p... [More]