In today’s article, we are throwing it back to one of the first data structures that we learned; linked lists. See here for a refresher on linked lists and how to implement your own linked list in JavaScript. …

We are continuing our coding challenge series with a problem involving binary trees. In our previous article, we used a Depth First Search approach to traverse a 2D grid and come to a solution regarding the number of islands in the grid. A DFS approach with trees involves traversing down…

As a continuation of our code challenge practice, we will be solving a common problem called Number of Islands using a graph traversal technique called Depth First Search (DFS, going forward). Problem Setup: We have a m x n grid represented by the nested array above. The 1s represent landmasses and 0s…

This week’s problem involves a data structure we previously covered, trees. Please visit the previous article here, to learn more about binary trees and to implement one on your own in JavaScript! A tree consists of interconnected nodes, the main relationship being parent nodes and child nodes. Binary trees are…

Today we will be working with a linked list, a very common data structure. For an in depth analysis and implementation of a linked list class in JavaScript, please see my article here. Linked List: The beauty of a linked list is in its simplicity. It is a linear data structure that…

In today’s post, we’re going to be solving the iconic coding challenge, Two Sum. For most people, this problem is fairly trivial but for others, it’s a great place to start and really exemplifies the strengths of certain data structures and we’ll go through a step-by-step solution and analysis within…

In our ongoing series covering some core data structures, we are up to hash tables also commonly known as hash maps. What are hash tables? Hash tables are used to store key-value pairs. A hash table can be considered a collection of these ‘KVPs.’ When implementing in JavaScript, we will be using an array…

As a continuation of our series on Data Structures in this article, we will be discussing Binary Heaps and I will be including code to implement a Binary Heap in JavaScript. As per my previous posts, Colt Steele’s Udemy course has been invaluable in my learning process. What is a Heap? In computer science…

As a continuation of our series on implementing data structures in JavaScript, we are going to be creating a Binary Search Tree class and attempt to traverse across each node in our tree. Again, I can’t stress enough how helpful Colt Steele’s Udemy course has been throughout this learning process…