you cracked the code!

Welcome to . You must love code as much as we do! Are you interested in a new challenge?

You and your friends have an awesome plan: visit 10 cities in 10 days.

For each city you found a cool hotel on trivago and you've noted down the hotel price per night. (Let's ignore all other costs right now.)

This is the data you collected (in JSON format).

The JSON document consists of a list of city objects. Each city object has a "name" field, which contains the name of the city (e.g. "New York"). Also each object contains a list of prices, ordered by day of travel, so the first entry in the list would be the price for the first night, the second entry would be the price for the second night and so on. If the entry is empty, then for this night the hotel is considered unavailable.

The task is to find the cheapest trip based on the given JSON data when you stay exactly one night in each hotel.

Participate by filling out the following information and get the chance to win a fabulous prize.

Total cost for cheapest trip:

Last city you will visit on the trip:

Your email: