Python weekend entry task

Script that fulfills all official readme requirements. In addition it includes some extra filters which are popular on flight search websites like Skyscanner.

As expected it will print the result in the terminal itself as a formatted json. A file can be stored in the same directory as the script, using as well an extra optional argument.

To run the script simply run the command:

python -m solution example/example0.csv RFZ WIW

Will output all flight combinations from RFZ to WIW, sorted from lowest to highest price.

A more sophisticated example:

python -m solution example/example3.csv WUE JBN --bags=1 --return --max-layover-time=8 --stops=2 --outbound-range=18:00:00-23:59:59 --trip-duration=12 --file

Will output all flight combinations from WUE to JBN, plus going back to WUE which allow 1 bag, a maximum layover time between flights WUE to JBN or JBN to WUE of 8 hours, a maximum of two stops in any trip, flying out from WUE between 18:00-23:59 of any day and a maximum trip duration of 12 hours (including layover time). Will also save the results in a file "results.json"

Detailed usage info can be shown using python -m solution --help

usage: solution.py [-h] [-b BAGS] [-R] [-l MIN_LAYOVER_TIME] [-L MAX_LAYOVER_TIME]
                   [-d DEPART_DAY] [-r RETURN_DAY] [-s STOPS] [-or OUTBOUND_RANGE]
                   [-rr RETURN_RANGE] [-t TRIP_DURATION] [-f]
                   csv_file_path origin destination

Python weekend entry task

positional arguments:
  csv_file_path         Relative path of the csv dataset file
  origin                Airport A
  destination           Airport B

options:
  -h, --help            show this help message and exit
  -b BAGS, --bags BAGS  Number of bags. If not specified, it is assumed that the user has no bags.
  -R, --return          If the user returns back to origin.
  -l MIN_LAYOVER_TIME, --min-layover-time MIN_LAYOVER_TIME
                        Minimum layover hours accepted.
  -L MAX_LAYOVER_TIME, --max-layover-time MAX_LAYOVER_TIME
                        Maximum layover hours accepted.
  -d DEPART_DAY, --depart-day DEPART_DAY
                        Day to start flyign to destination in format YYYY-MM-DD.
  -r RETURN_DAY, --return-day RETURN_DAY
                        Day to start flyign back to origin in format YYYY-MM-DD, if there is a return trip.
  -s STOPS, --stops STOPS
                        Maximum number of stops.
  -or OUTBOUND_RANGE, --outbound-range OUTBOUND_RANGE
                        Time range of accepted outbound departure flight times in format HH:MM:SS-HH:MM:SS.
  -rr RETURN_RANGE, --return-range RETURN_RANGE
                        Time range of accepted return departure flight times in format HH:MM:SS-HH:MM:SS.
  -t TRIP_DURATION, --trip-duration TRIP_DURATION
                        Maximum trip duration in hours (A -> B). For round trips it is the maximum time of any of both trips, using Skyscanner's standard.
  -f, --file            Save results to file results.json.
  -n, --not-print       Avoid printing the combinations found

Bad data is handled using the logging library. Any argument or csv data error that makes the code unable to continue prints the error and exits script execution. In case of a specific bad flight row in the csv, it just ignored the flight and continues with other data.

Write a python script/module/package, that for a given flight data in a form of csv file (check the examples), prints out a structured list of all flight combinations for a selected route between airports A -> B, sorted by the final price for the trip.

You've been provided with some semi-randomly generated example csv datasets you can use to test your solution. The datasets have following columns:

• flight_no: Flight number.
• origin, destination: Airport codes.
• departure, arrival: Dates and times of the departures/arrivals.
• base_price, bag_price: Prices of the ticket and one piece of baggage.
• bags_allowed: Number of allowed pieces of baggage for the flight.

In addition to the dataset, your script will take some additional arguments as input:

• By default you're performing search on ALL available combinations, according to search parameters.
• In case of a combination of A -> B -> C, the layover time in B should not be less than 1 hour and more than 6 hours.
• No repeating airports in the same trip!
  • A -> B -> A -> C is not a valid combination for search A -> C.
• Output is sorted by the final price of the trip.

You may add any number of additional search parameters to boost your chances to attend. Here are 2 recommended ones:

Example input (assuming solution.py is the main module):

python -m solution example/example0.csv RFZ WIW --bags=1 --return

will perform a search RFZ -> WIW -> RFZ for flights which allow at least 1 piece of baggage.

• NOTE: Since WIW is in this case the final destination for one part of the trip, the layover rule does not apply.

The output will be a json-compatible structured list of trips sorted by price. The trip has the following schema:

For more information, check the example section.

Assuming your solution is working, we'll be additionally judging based on following skills:

• input, output - what if we input garbage?
• modules, packages & code structure (hint: it's easy to overdo it)
• usage of standard library and built-in data structures
• code readability, clarity, used conventions, documentation and comments

• Your solution needs to contain a README file describing what it does and how to run it.
• Only the standard library is allowed, no 3rd party packages, notebooks, specialized distros (Conda) etc.
• The code should run as is, no environment setup should be required.

Follow the instructions you received in the email.

Let's imagine we wrote our solution into one file, solution.py and our datatset is in data.csv. We want to test the script by performing a flight search on route BTW -> REJ (we know the airports are present in the dataset) with one bag. We run the thing:

python -m solution data.csv BTW REJ --bags=1

and get the following result:

[
  {
    "flights": [
      {
        "flight_no": "XC233",
        "origin": "BTW",
        "destination": "WTF",
        "departure": "2021-09-02T05:50:00",
        "arrival": "2021-09-02T8:20:00",
        "base_price": 67.0,
        "bag_price": 7.0,
        "bags_allowed": 2
      },
      {
        "flight_no": "VJ832",
        "origin": "WTF",
        "destination": "REJ",
        "departure": "2021-09-02T11:05:00",
        "arrival": "2021-09-02T12:45:00",
        "base_price": 31.0,
        "bag_price": 5.0,
        "bags_allowed": 1
      }
    ],
    "bags_allowed": 1,
    "bags_count": 1,
    "destination": "REJ",
    "origin": "BTW",
    "total_price": 110.0,
    "travel_time": "6:55:00"
  },
  {
    "flights": [
      {
        "flight_no": "JV042",
        "origin": "BTW",
        "destination": "REJ",
        "departure": "2021-09-01T17:35:00",
        "arrival": "2021-09-01T21:05:00",
        "base_price": 216.0,
        "bag_price": 11.0,
        "bags_allowed": 2
      }
    ],
    "bags_allowed": 2,
    "bags_count": 1,
    "destination": "REJ",
    "origin": "BTW",
    "total_price": 227.0,
    "travel_time": "3:30:00"
  }
]