Discussion thread for day 20 of the Advent of Code - https://adventofcode.com/2024/day/20
I modified Day16 macro for Day20.
At first, I calculated each step for route. For part 1, find the 2 distance difference conbination that has more than 100 step savings, and there is wall(#). For part2, no need to check the walls, distance is less than 20 and savings is more than 100.