First 4 days implemented

Author: am93

README.md

@@ -0,0 +1,10 @@
+# 🎄 Advent of Code 2022 solutions 🎄
+
+This repository contains my solutions for AoC 2022 written in **Python** 🐍 I kindly ask all visitors ***not to judge*** code quality or maintainability, due to the following reason:
+- it is a time oriented competition ⏰ - meaning just find the solution to the problem ASAP,
+- I tend to overcomplicate solutions with list comprehensions and functional programming approach
+  - most of the time, there is an easier solution available, but I like to sharpen my functional approach 😇
+
+Thanks for stopping by 👋 If you like any of the solutions drop a ⭐ to this repository.
+
+Don't forget to support [Advent of code](https://adventofcode.com/2022/support).

day01.py

@@ -0,0 +1,4 @@
+with open('inputs/day01.txt', 'r') as data:
+    elf_cal = sorted([sum(map(int,cals_per_elf.split('\n'))) for cals_per_elf in data.read().split('\n\n')])
+    print('Most calories: '+str(elf_cal[-1]))
+    print('    Top three: '+str(sum(elf_cal[-3:])))

day02.py

@@ -0,0 +1,30 @@
+# part1
+scores1 = {
+    'A X': 4,
+    'A Y': 8,
+    'A Z': 3,
+    'B X': 1,
+    'B Y': 5,
+    'B Z': 9,
+    'C X': 7,
+    'C Y': 2,
+    'C Z': 6,
+}
+
+# part2
+scores2 = {
+    'A X': 3,
+    'A Y': 4,
+    'A Z': 8,
+    'B X': 1,
+    'B Y': 5,
+    'B Z': 9,
+    'C X': 2,
+    'C Y': 6,
+    'C Z': 7,
+}
+
+with open('inputs/day02.txt', 'r') as data:
+    match_data = data.read().split('\n')
+    print('Part1: ',sum(map(lambda match : scores1[match], match_data)))
+    print('Part2: ',sum(map(lambda match : scores2[match], match_data)))

day03.py

@@ -0,0 +1,11 @@
+with open("inputs/day03.txt") as f:
+    data = f.read().splitlines()
+
+score = lambda x : ord(x) - ord('a') + 1 if x >= 'a' and x <= 'z' else ord(x) - ord('A') + 27
+
+part1 = sum(score(set(x[:len(x)//2]).intersection(set(x[len(x)//2:])).pop()) for x in data)
+print ('Part1: ',part1)
+
+iter_data = iter(data)
+part2 = sum(score(set(x[0]).intersection(set(x[1])).intersection(set(x[2])).pop()) for x in zip(iter_data,iter_data,iter_data))
+print ('Part2: ',part2)

day04.py

@@ -0,0 +1,8 @@
+with open('inputs/day04.txt') as f:
+    data = [list(map(int,line.replace(',','-').split('-'))) for line in f.read().splitlines()]
+
+overlap_full = sum(map(lambda x : (x[0] <= x[2] and x[1] >= x[3]) or (x[2] <= x[0] and x[3] >= x[1]), data))
+print('Part 1: ', overlap_full)
+
+overlap_count = sum(map(lambda x : (x[0] <= x[2] and x[1] >= x[2]) or (x[2] <= x[0] and x[3] >= x[0]), data))
+print('Part 2: ', overlap_count)