Day 1
It is my first day back on leetcode. I have done / seen most of the questions on Grind 75 before and I thought I would be able to do the easy problems without any problems. Unfortunately, I am wrong. I spent quite a lot of time figuring out two sum and valid parentheses and an incredible amount of time trying to Merge Two Sorted Lists together. This is just Day 1, even though I am not happy with my performance, it just means that I have a lot to work on :)
Day 2 (13/01)
Started off with little confidence, I realised that the more questions I do, the more I become. In the past, I tend to want to immediately watch neetcode after seeing a problem that I am intimidated by. I have realised that doing that may have been impeding my progress as well as my confidence. Doing so many easy problems so far is quite helpful in building my confidence back up.
Day 3 (14/01)
I feel a little sick today, nose is blocked and my brain is a little fogged up. My confidence for tree related problems is mid. I took a surprising amount of time to reverse a linked list even though I have done it many times before. Good thing is that I eventually managed to figure out how to do it myself but I was starting to get a little frustrated at myself.
Day 4 (15/01)
Still a little sick. Good thing is that I managed to complete Maximum Depth of Binary Tree (I was stuck on this yesterday) by myself today without any help. Touched the first few Medium problems today. Feeling more confident about easy problems 😄 Honestly don’t know if this is considered as progress because I have seen most of these questions before.
Day 5 (16/01)
First day of medium problems 🫠 Very slow day, only did 2 questions but manage to revise some new things. I felt lowkey frustrated knowing that I need so much time (> 1 hr) to attempt the questions / watch videos on how to do it. However, I think some of the concepts I covered agin today are quite new to me because I didn’t give myself the chance to properly learn it back in 2040s. For example I exposed myself to the heap data structure! O(n) to heapify, O(log(n)) for push and pop operations. Python has an in-built min-heap that I can use.
Day 6 (18/01)
Skipped yesterday because of HnR. I think I will not make leetcoding compulsory on weekends so that I don’t stress myself out. Did a bunch of medium problems today that I have seen before. Could solve a lot of them, my mind is kind of distracted today and I had to force myself to focus on the problems.