Advent of Code 2022

Teradyne Leaderboard

DAY	STARS	C#	Time Complexity (A)	Time Complexity (B)	Solution Description
Day 1: Calorie Counting	⭐️⭐️	Solution	O(n)	O(n)
Day 2: Rock Paper Scissors	⭐️⭐️	Solution	O(n)	O(n)
Day 3: Rucksack Reorganization	⭐️⭐️	Solution	O(n)	O(n)	2 pointer algo and 'HashSet'
Day 4: Camp Cleanup	⭐️⭐️	Solution	O(n)	O(n)	using formula to determaine the overlap area.
Day 5: Supply Stacks	⭐️⭐️	Solution	O(n)	O(n)	using 'Stack' to reverse the order in partB
Day 6: Tuning Trouble	⭐️⭐️	Solution	O(n)	O(n)	'Map' to store character positions and 'HashSet' to check for char duplicates
Day 7: No Space Left On Device	⭐️⭐️	Solution	O(n logH)	O(n logH)	Directory data stored as an n-ary tree of height H
Day 8: Treetop Tree House	⭐️⭐️	Solution	O(n.M)	O(n.(M^2))	M -> number of columns. Used 'Stack' in partA to acheive linear time complexity. Need to optimize partB!
Day 9: Rope Bridge	⭐️⭐️	Solution	O(n)	O(n)
Day 10: Cathode-Ray Tube	⭐️⭐️	Solution	O(n)	O(n.S)	S -> sprite width (if S is very small we can neglect it)
Day 11: Monkey in the Middle	⭐️⭐️	Solution	O(n)	O(n)	'Queue' to maintain the "items" for each monkey and a larger data type (long) for "worry" levels.
Day 12
Day 13
Day 14
Day 15
Day 16
Day 17
Day 18
Day 19
Day 20
Day 21
Day 22
Day 23
Day 24
Day 25