Attempted to apply the new approach I discovered to a complicated recursion example problem from the book. Well, it did not go too well. I ended up with a really complicated answer that was not equal to what was given in the book. Additionally the book proved a much simpler solution. Well it’s back to the drawing sheet. I still think I made some progress but I still need to tweak my approach a bit.
TLDR;
Okay, so here are the highlights of what I did:
- Still reading through the book “Cracking the Coding Interview” by Gayle Laakmann McDowell. Since I am stuck on practice problem eleven I am trying to review the concept of Recursion and determining the time complexity for recursive algorithms. I was testing out a new approach I found on a previously covered example problem in the book. Example twelve in the section dealt with a permutations algorithm and was one of the more complicated problems in the book. I figured, if I am able to solve this problem I have improved in my approach. I failed in getting the correct answer so I clearly need some more work. lol
Conclusion
That’s all for today. This is my sixth round of the “#100daysofcode” challenge. I will be continuing my work from round five into round six. I am currently working through the book “Cracking the Coding Interview” by Gayle Laakmann McDowell. My goal is to become more familiar with algorithms and data structures. This goal was derived from my goal to better understand operating systems and key programs that I use in the terminal regularly e.g. Git. This goal was in term derived from my desire to better understand the fundamental tools used for coding outside of popular GUIs. This in turn was derived from my desire to be a better back-end developer.
I have no idea if my path is correct but I am walking down this road anyways. Worst case scenario I learn a whole bunch of stuff that will help me out on my own personal projects.