FOFortunatus Olorunsolainfortunatus-notes.hashnode.dev·19h ago · 10 min readSolving 1920: how to store 2 numbers in 1Check out the problem here. The first and obvious solution to this problem is even in the question: ans[i] = nums[nums[i]]. You loop over the nums array and in each iteration, you just put whatever nu00
FOFortunatus Olorunsolainfortunatus-notes.hashnode.dev·21h ago · 3 min readWhere Elegant Solutions Actually Come FromHere's a problem for you: add up every number from 1 to 100. Take a sec. How would you do it? Did you go for the obvious approach: start at 1, add 2, add 3, and keep going until 100? I understand. It'00
FOFortunatus Olorunsolainfortunatus-notes.hashnode.dev·Apr 21 · 1 min readProblem Solving like a ProgrammerThat's a snapshot of the introduction section of V. Anton Spraul's book, THINK LIKE A PROGRAMMER. I hope you read the image. After that, think about whether or not you still attack a problem by trying00
FOFortunatus Olorunsolainfortunatus-notes.hashnode.dev·Apr 3 · 5 min readAn introduction to bash aliasesHey, there! I'm a noob. Now, I'm not winning any competitions for "bearer of the longest name" but my name is long enough that most people don't wanna have to call me the whole thing every time they'd12M