I am currently trying to learn various things like: Rust Haskell Distributed Systems, …etc. To achieve this, I have been exploring various resources: I have been delving into Alexis King’s blog at this link to gain a deeper understanding of typeclass metaprogramming. I have attempted several challenges provided by fly.io, some of which I have documented here. I am referencing a list of papers mentioned in the course syllabus, available here....
Throughout my childhood, I held a keen interest in computers, particularly in gaming. However, the technical\science aspects didn’t initially captivate me. Back in 2010, acquiring new games was a challenge due to limited internet access. We relied on friends with installation CDs, DVDs, or pendrives. Unfortunately, scratched disks often led to checksum errors or missing files, which forced us to download DLLs/files from the internet to fix issues. Encountering language barriers(English is not my first language) or difficult game levels led us to seek cheat engine for assistance....
I aim for a high impact career, and the more I contemplate this, the more I realize it cannot be achieved by sticking to one field alone. I’ve been entrenched in the computer science realm for some time, with a side interest in machine learning/data science. While my past roles have mainly revolved around fintech or logistics, I believe achieving greater career impact necessitates cross-pollination across different domains, blending diverse ideas to enhance my work....
AOC-2023-5 If You Give A Seed A Fertilizer This problem was hardest yet and took longest to solve. so the problem asks us to create a map from seed to location such as: seed -> soil -> fertilizer -> water -> light -> temprature -> humidity -> location where we are given certain mappings from one entity to another, eg: seed 1 corresponds to soil 10 and given this mapping and intial seed list we need to find the minimum location....
AOC-2023-4 Scratchcards This problem was easy in the sense that it required just required correct parsing and following the rules to get the result in the problem. Part 1 Part 1 just required correct parsing and computing the solution. Part 2 Part 2, says that for each winning card with n numbers, we will get extra copies of next n cards, so to maintain the number of extra cards we used a state monad, to keep track of how may extra copies each card have....