I continued my practice of mathematical induction proofs. I think I understand the idea now but the real test comes when I go back to the example relating to binary trees and proving their height formula. It felt great learning about the concept. I can honestly see myself using this in the future.

TLDR;

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

• Still reading through the book “Cracking the Coding Interview” by Gayle Laakmann McDowell. Still working on example nine. I continued to practice using mathematical induction to prove a statement is true. I finished the practice problems I found from a YouTube video. All that is left is for me to review the concept and to apply it back to the example problem. Step by step it’s all coming together.

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!