I continued to work on Recursive run times with Big O Notation. Spending a bit more time on it helped to drive home how it works. Thankfully it didn’t turn require another unexpected deep dive into the math behind the time and space complexity calculations.

TLDR;

Okay, so here are the highlights of what I did:

• I continued reading through the book “Cracking the Coding Interview” by Gayle Laakmann McDowell. I got through the rest of the section on Big O Notation. All that is left, is to go through the examples again to see if I can calculate the time and space complexities myself. I look into the “Sum of Powers of 2” at the back of the book to better understand how to calculate recursive runtimes. That was the last topic that I was uncomfortable with regarding Big O Notation. Hopefully it’s smooth sailing from here.
• Looked into different certifications that are offered by Microsoft and AWS. I might start working on some outside of the challenge to help buff my knowledge base with popular tools in the industry.

Conclusion

That’s all for today. If you are interested in the MIT course you can check out the video lecture I’m currently going through. The lecture is helpful but isn’t sufficient by itself. Anyways, until next time PEACE!