Day 5¶
Solution to day 5 of Advent of Code https://adventofcode.com/2018/day/5
Data preparation¶
Since both part 1 and two use the same data, we create a function to read and prepare the data in the file:
Solution to day 5 of Advent of Code https://adventofcode.com/2018/day/5
Since both part 1 and two use the same data, we create a function to read and prepare the data in the file:
Solution to day 4 of Advent of Code https://adventofcode.com/2018/day/4
Since both part 1 and two use the same data, we create a function to read and prepare the data in the file:
Solution to day 3 of Advent of Code https://adventofcode.com/2018/day/3
Since both part 1 and two use the same data, we create a function to read and prepare the data in the file:
Solution to day 1 of Advent of Code https://adventofcode.com/2018/day/2
Making use of Counter from collections to count the number of occurences of each letter.
Solution to day 1 of Advent of Code https://adventofcode.com/2018/day/1
Part one is simple list comprehension and sum:
Testing out "https://github.com/danielfrg/pelican-ipynb" , a plugin that allows you to blog with Jupyter notebooks.
Project Euler #2 "https://projecteuler.net/problem=2", By considering the terms in the Fibonacci sequence whose values do not exceed four million, find the sum of the even-valued terms.
By using a loop (and not a recursive function) we avoid the only pit fall here, calculating the answer in very short time.
read moreCopy direct from blob storage to data lake
read moreFibonacci numbers occur many places in science, in nature and especially in programming puzzles. They are easy to understand, and easy to implement, poorly. In this blog post I will show the naive way, the "standard" way, and in the end a sub-linear algorithm for calculating the nth Fibonacci number …
read morePage 1 / 2 »