Let's try to implement Dijkstra algorithm in Kotlin to solve the next graph related problem from Advent.
Let's see how critical can be problem representation in your problem with some data structures.
Discuss some basic transformations on 2D plane to get our origami puzzles ready for the Christmas 🎄.
See what are the `value class`es and how to represent a graph structure in Kotlin.
Let's use the `LazyDefaultMap<K, V>` with small fixes to solve cute simulation of flashing octopus.