Finished going through the Java tutorial video. The video didn’t cover pointers much which was disappointing but it was a decent introduction. I am now ready to start working on the core data structures that appear on technical interview questions. The first topic is “Linked Lists”.

TLDR;

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

• Started on the “Technical Questions” section of the book “Cracking the Coding Interview” by Gayle Laakmann McDowell. I decided to get a quick intro to the C and Java programming languages before I jump into building the core data structures and algorithms that will be covered in most all technical interviews. Finished the beginner’s tutorial for Java. I queued up a few videos on Linked Lists. The goal is to produce my own samples in pseudo code, C , and in Java. My hope is that this method of repetition will help me have clear examples I can reference back to but will also give me the repetitive exposure to the data structure’s key features.

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.