pleroma.debian.social

I chose to use a tree data structure. I spent yesterday writing my own tree implementation and fighting with the borrow checker in #rust. Then, before going to bed, I looked online to see how others wrote the tree data structure in rust and I found a post that explained how trees are pain in rust. Of course, I see someone else's solution for AOC day 7 in the comments of the post which used a reverse lookup hash table - a much better solution.

@stacyharper Thanks! I had some issues with the video call but theyve totally fixed the connectivity issues I was having before.

I hope I find the cause of jami segfaulting.

@cnx ohhhh, the hashmap idea is really good.

Nice. I didnt think of that.

Feel free to reply with your solutions or give me constructive criticsm. Im still learning.

I hope the CW for this post is ok.

#rust #rustlang

Lol, someone solved day 1 in factorio: https://libreddit.kavin.rocks/r/adventofcode/comments/zb48iw/it_took_me_a_bit_longer_than_others_for_the/

After finishing yesterday, I spent some time on day 24 of AOC 2021 and I learned alot about rust. I just finished part 2 of day 3 and Im improving. I spent less time today fighting with the borrower.

My solution is here: https://git.sr.ht/~anjan/advent2022/tree/main/item/day3

Before looking at other people's solutions, I think I couldve concatenated and sorted the strings to speed it up. Excited to see how people solved this in one line on reddit :)

@jbauer I solved this problem using your alternative method =P. I used rust and programmed bubble sort from scratch.

I thought of your method but didn't have time to program it. Regardless, it's nice to see a method that uses less memory in action. Looking forward to following your progress during this year's advent of code! Happy holidays