It’s not my first choice, but it’s gonna be TypeScript for me. I’ve got an interview for a primarily TS position coming up this week so would like to brush up on its quirks.
If the interview doesn’t go well, then I’ll probably switch to Go, though hehe. I’ve been really enjoying using it, but no one’s ever paid me to do so.
I’ve started with Go, but I think I’ve realised AoC isn’t for me. I feel so incredibly dense.
After solving puzzles and seeing other peoples’ elegant solutions while mine feels brutish and ugly (even if our approaches use the same algorithm, mine is inevitably less elegantly-implemented), I also feel too stupid for AoC sometimes.
But hey, I am never going to get less stupid if I don’t try, and solving problems the ugly way is still a solution. I have fun doing it.
But if it’s not just the comparison to others ruining your fun, if it’s that you inherently do not find this activity enjoyable, don’t force yourself!
That’s fair if you aren’t having fun, but I wouldn’t write it off completely. Like I only made it to day four last time.
The problems they present are of a totally different class to what most programmers will ever encounter in the “real world.”
Once you get more used to the style of the problems (data structures and algorithms (DSA), like what you might see on leetcode), then you honestly start to have fun with them.
I really struggled with DSA until recently, so if you’d like some help I would be happy to give you some pointers.
Thanks. I felt very deflated after struggling with something seemingly so simple. I was using Go and couldn’t figure out part 2, at least without nesting loops three layers deep.
Today I decided to try to learn Elixir instead and allowed myself some assistance from Claude.ai, which was much more fun.
Nesting loops is indeed the first intuition anyone would have to that problem. The only reason I knew to use a hashmap data structures is because I practiced on exactly these kinds of problems, and looked up explanations and answers on the most basic stuff imaginable.
I felt very deflated after struggling with something seemingly so simple.
Definitely not simple. Especially without training in DSA. You shouldn’t expect yourself to spontaneously invent efficient algorithms to problems that have been stumping students for decades.
Try it out yourself for maybe 30 minutes, then do yourself a favour and look up a good explanation to solving it.
My hope for this year is that we can help eachother understand and solve these problems. I’d love to find some good “editorials” on each problem, breaking them down in detail.
