I thought I had solved it but my answer was wrong. There is some fundamental insight that I am still missing. It sucks but it seems like I need to review the concepts behind recursive algorithms and the example problems dealing with them. Without a comfortable understanding of what is happening with the recursive calls I will keep struggling with these types of problems.

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 the practice problems. Question eleven has me questioning whether I am ready to move on or not. Throughout these past fifty days studying Big O notation I have struggled whenever it came to recursive algorithms. Maybe I just suck or it’s a common problem for most developer. However, this can’t continue forever. I cannot stand to suck at what I do. So I think my struggles with this question and my wrong answers give me an opportunity to review. I think some watching some YouTube videos might also give me a fresh perspective. Fingers crossed because I only have two days left to meet might goal of getting through the section. No pressure…

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!