One thing I am enjoying in AoC is that it gives you half the reward when you solve part-one which is good by itself but when trying to solve part-two there is some voice in the back of my head that says you have to use functions you used in part-one to solve this one, and I think they want us to do it this way.

Day 3 part 2 really made me look into pattern matching and recursion.

In the python version you can see that I used a normal for loop to filter a list based on some conditions(I used a variable to hold the state whether I have to add the current item to the new list) but in FP variables are immutable so i can't flip through two states. So the solution turned out to be recursion with some pattern matching.

Even if I am not keeping up with the day to day questions, I am learning something new here and there.