🎄 ADVENT OF CODE 🎄

I solved problems from Advent of Code to learn and practice Data Structures and Algorithms (DSA) in Python. Categorized problems listed below summarize my learning experiences.

Puzzles that are not listed under any category were solved using the combinations of different Data Structures. Categorized days listed below are only primary examples of each corresponding category.

🎅 2022

• List

  • day 3
  • day 4
  • day 6
  • day 18
  • list/array is used in almost every puzzle

• Queue, Stacks

  • day 5
  • day 19
  • day 21

• Heap

  • day 12

• Dictionaries, Hashmap

  • day 2
  • day 9
  • day 7
  • day 16
  • day 15
  • day 19
  • day 22
  • day 25

• Tree, Graphs

  • day 8
  • day 12
  • day 14
  • day 17
  • day 21
  • day 22

• Dijkstra's

  • day 12

• Floyd Warshall

  • day 16

• Dynamic Programming

  • day 14
  • day 16

• Depth First Search

  • day 7

• Breath First Search

  • day 19
  • day 21

⛄ 2023

• Flood Fill

  • day 18

• Quick Sort

  • day 7

• Dijkstra's

  • day 21
  • day 17

• Dictionaries, Hashmap

  • day 1
  • day 3
  • day 5
  • day 8
  • day 10

• List

  • day 2
  • day 9
  • day 11

• Dynamic Programming

  • day 12
  • day 23

• Breath First Search

  • day 10
  • day 16
  • day 20
  • day 21
  • day 22

• Depth First Search

  • day 23

❄️ Math

Besides DSA, solving AOC also requires math. Listed below is a few examples

• Matrix (rotation,transpose): day 5 2022,day 14 2023

• Complex Numbers (to represent vectors): day 9 2022, day 17 2022

• Linear Algebra: day 15 2022, day 6 2023

• Modulus :day 14 2023

🚀 Others

• Syntax:
  • lambda
  • match-case statement
  • zip
  • enumerate
  • eval
  • reduce
  • map
  • any, all
  • join
  • sorted
• Modules:
  • collections: defaultdict, deque, namedtuple, Counter
  • itertools: groupby, permutation, cycle
  • re (regex)
  • math : lcm, sqrt, floor, ceil, remainder