| Puzzles | Solved | % |
|---|---|---|
| 450 | 42 | 9% |
| Days | Solved | % |
|---|---|---|
| 250 | 21 | 8% |
- Day 1
- Day 2
- Day 3 - over complicated solution (8/10)
- Day 4 - simple, but you need some interpretation skills for the part 2 (3/10)(7/10)
- Day 5 - interpretation, interpretation, interpretation and how to manipulate the puzzle input (5/10). Part 2 memory usage (9/10). Infer and narrow down the lot of seeds
- Day 6 - simple (3/10)
- Day 7 - simple but verbose (4/10). Part 2 more complex (6/10)
- Day 8 - simple (3/10). Part 2 you need to use LCM (least common multiple) (4/10), do not use brute force please :)
- Day 9 - simple (4/10)
- Day 10 - Matrix day. Not the hardest (4/10). Hard part 2 (8/10)
- Day 11 - One more matrix day. Calculate distance between 2 points in a 2D matrix (Manhattan distance) (5/10). Part 2 if expands 1 can expand 2, 3, 4..., work with the coordenates deltas (8/10)
- Day 12
- Day 13
- Day 14 - simple matrix day (4/10). Part 2 hunt for a pattern - Floyd's Tortoise and Hare Algorithm (Cycle Detection - loop detection) (8/10)
- Day 15 - ASCII code day. charCodeAt() and modulo operation will be your friends (2/10). Part 2 it is all about interpretation (5/10). Almost a rest day.
- Day 16
- Day 17
- Day 18 - Calculate Polygon Area (Shoelace Formula) and play with the perimeter. This one was hard (9/10). Part 2 is very simple if you use the shoelace formula in part 1 (3/10)
- Day 19
- Day 20
- Day 21
- Day 22
- Day 23
- Day 24
- Day 25
- Day 1
- Day 2
- Day 3
- Day 4
- Day 5
- Day 6
- Day 7
- Day 8
- Day 9
- Day 10
- Day 11
- 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
- Day 1
- Day 2
- Day 3
- Day 4
- Day 5
- Day 6
- Day 7
- Day 8
- Day 9
- Day 10
- Day 11
- 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
- Day 1
- Day 2
- Day 3
- Day 4
- Day 5
- Day 6
- Day 7
- Day 8
- Day 9
- Day 10
- Day 11
- 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
- Day 1
- Day 2
- Day 3
- Day 4
- Day 5
- Day 6
- Day 7
- Day 8
- Day 9
- Day 10
- Day 11
- 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
- Day 1
- Day 2
- Day 3
- Day 4
- Day 5
- Day 6
- Day 7
- Day 8
- Day 9
- Day 10
- Day 11
- 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
- Day 1
- Day 2
- Day 3
- Day 4
- Day 5
- Day 6
- Day 7
- Day 8
- Day 9
- Day 10
- Day 11
- 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
- Day 1
- Day 2
- Day 3
- Day 4
- Day 5
- Day 6
- Day 7
- Day 8
- Day 9
- Day 10
- Day 11
- 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
- Day 1
- Day 2
- Day 3
- Day 4
- Day 5
- Day 6
- Day 7
- Day 8
- Day 9
- Day 10
- Day 11
- 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
Tips and Tricks for Solving Advent of Code's Puzzles
Breadth First Search or BFS for a Graph
Depth First Search or DFS for a Graph
Tree Traversal Techniques – Data Structure and Algorithm Tutorials
Tree Data Structures in JavaScript for Beginners
cd 2023\day-1
node --watch a.js
and
node --watch b.js