# 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:

# Advent of Code Day 5

# 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:

# Advent of Code Day 4

# Day 4¶

Solution to day 4 of Advent of Code https://adventofcode.com/2018/day/4

## 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:

# Advent of Code Day 3

# Day3¶

Solution to day 3 of Advent of Code https://adventofcode.com/2018/day/3

## Data preparation¶

# Advent of Code Day 2

# Day2¶

Solution to day 1 of Advent of Code https://adventofcode.com/2018/day/2

## Part 1¶

Making use of Counter from collections to count the number of occurences of each letter.

# Advent of Code Day 1

# Advent of Code calendar¶

Solution to day 1 of Advent of Code https://adventofcode.com/2018/day/1

## Day 1 part 1¶

Part one is simple list comprehension and sum:

# Dolphins

# Project Euler #2 Summing Fibonacci

# Project euler #2¶

Testing out "https://github.com/danielfrg/pelican-ipynb" , a plugin that allows you to blog with Jupyter notebooks.

## Problem definition¶

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 more# Copy directly from azure blob storage to azure data lake.

Copy direct from blob storage to data lake

read more# Calculating the last digits of large fibonacci numbers

Fibonacci 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 more

Page 1 / 2 »