As I practice more algorithm problems, I sometimes find it challenging to identify the right time to use the appropriate data structure. While, doing lots of problems is a sure bet to develop …
Make BFS Your BFF
As I am continuing to learn more about algorithms and data structures, I have found one particular kind of problem that has been giving me trouble: Breadth First Search. Because I was having a hard …
Big-O
Big-O is pretty important. It is the metric that is used to describe the efficiency of algorithms. Having a thorough understanding of Big-O is crucial for ensuring that algorithms are as …
Stacks & Queues
Stacks and queues are some pretty neat data structures in my opinion. In some ways they are similar. They are both linear data structures after all. But, there are certainly some key differences. …
I Speak for the Trees
Trees are similar to linked lists in that they are made up of nodes and links. There are certainly some differences between the two though. Let's find out what makes a tree a tree. What …
Linked Lists
When first learning about Computer Science, arrays were one of the first things that I learned about. For the longest time, I had no idea what a linked list was. Linked lists are pretty important …