Moved on to the next couple examples and met my old friend recursive algorithms. I have to keep telling myself that I am learning with new examples, otherwise, I would get defeated by how often I am wrong with my initial calculations. I need to find a resource to practice calculating Big O Notation runtimes. I have deliberately gone very slow through the example material to try and maximize my learning with the limited examples and solutions provided in the book.

TLDR;

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

• Still reading through the book “Cracking the Coding Interview” by Gayle Laakmann McDowell. I moved on to examples thirteen and fourteen. It covered recursion again. It amazes me how many times I can optimistically try to solve a problem and then get it wrong. But without failure there can be no success. Still just trying to make progress each day regardless of how small it is.

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!