[2022 Day 7 (Part 1)][Python] I already solved day 7, but want some pointers on how to use recursion to solve it

• advent_of_code_2022

  1 0 10.0 Python

  My solutions to the Advent of Code 2022 challenge, writen in Python (by jangboolee)

My full solution is here.

• aoc2022

  1 2 6.5 Forth

  My Advent of Code solutions in 25 different programming languages with explanations included. (by Iamlel)

Im not sure if my solution is any good but I used a parent pointer tree, and each node had a size and parent. Then, I put all the directions into a list, and on cd .. you just get the parent of the parent. At the end, i did have to loop through and add the sizes of all the children to their parent, or you could do that as you go. Here is my code: code and I also included an explanation of the solution in the readme.md.

• InfluxDB

  www.influxdata.com featured

  Power Real-Time Data Analytics at Scale. Get real-time insights from all types of time series data with InfluxDB. Ingest, query, and analyze billions of data points in real-time with unbounded cardinality.

  

Suggest a related project