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.
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.
Yes, I guess I held myself to too high expectations. I haven’t even studied CS and learned programming on my own… I’ve been trying to do some exercises and a few courses on algorithms but of course that can’t be compared to going to university. Thanks for the tip, I won’t spend hours in frustration in the coming days for sure. Maybe I should post my attempts even though they are incomplete or fail, to spark discussion.
