Skip to content

Latest commit

 

History

History
70 lines (64 loc) · 2.4 KB

README.md

File metadata and controls

70 lines (64 loc) · 2.4 KB
Raw

Description

This project provides solutions to the Advent of Code 2016.

Installation

Solutions can be ran from Python 2.7. Inputs of the problems are in the 'inputs' directory.

For instance :

$ python day01.py

Notes about the Provided Solutions

  1. Day 1: No Time for a Taxicab
  2. Day 2: Bathroom Security
  3. Day 3: Squares With Three Sides
  4. Day 4: Security Through Obscurity
  5. Day 5: How About a Nice Game of Chess?
    • Usage of hashlib and hexdigest
  6. Day 6: Signals and Noise
    • Usage of collections.Counter
  7. Day 7: Internet Protocol Version 7
    • Usage of re to split a string given more than one delimiter
    • Implementation of 'slice_n' for a string (generator of substring of size 'n')
  8. Day 8: Two-Factor Authentication
  9. Day 9: Explosives in Cyberspace
    • Regular expression (via re)
    • Recursivity
  10. Day 10: Balance Bots
  11. Day 11: Radioisotope Thermoelectric Generators
    • Solution is based on A* algorithm (there is a need to tweak the heuristics)
    • Input is manually set in the code
    • Usage of itertools, heapq
    • Usage of immutable datastructure (tuples)
  12. Day 12: Leonardo's Monorail
    • Naive solution using regex
    • Takes some time for part 2
  13. Day 13: A Maze of Twisty Little Cubicles
    • Solution is based on Dijkstra's algorithm
    • Usage of heapq (PriorityQueue)
  14. Day 14: One-Time Pad
    • Usage of hashlib and hexdigest
    • Usage of regex backreferences
    • Caching results of stretch hash for efficiency (part 2)
  15. Day 15: Timing is Everything
  16. Day 16: Dragon Checksum
  17. Day 17: Two Steps Forward
    • First part: breadth-first search (BFS)
  18. Day 18: Like a Rogue
  19. Day 19: An Elephant Named Joseph
    • Second part uses a double-linked list for solving this kind of pop/append problem
  20. Day 20: Firewall Rules
  21. Day 21: Scrambled Letters and Hash
    • Usage of permutations from itertools for part 2 (brute-forcing)
  22. Day 22: Grid Computing
    • Part 2 is resolved manually by displaying the grid
  23. Day 23: Safe Cracking
    • Reusing solution of day 12
    • Part 2 is solved by hacking the interpreter between line 4 and 10
  24. Day 24: Air Duct Spelunking
    • Reusing implementation of day 13 (Dijkstra's algorithm)
  25. Day 25: Clock Signal
    • Adapting solutions of day 12 and 23
    • Solutions is found by brute-forcing and checking the first 100 generated items

License

GPLv3 - see the COPYING file.