Selecting A combination of minimum cost

Question

I have data of different items in a different restaurants

    Rest    Item     Price
    ----------------------
    ABC     dosa      14
    ABC     idly             


        

Answer 1

1. Calculate the possible price combinations: Iterate through the map and parse the strings. Store each price combination.

2. Filter out the more expensive prices.

3. Compare the remaining prices at each restaurant, and return the restaurant with the cheapest price.

You could also do some checks to minimise iterations, e.g:

• If idly is > than idly+umpa, don't calculate the any combinations involving idly.