Dynamic Programming, Fibonacci NumbersDynamic Programming can be used to optimize problems by breaking it into subproblems and storing those solutions. If we are looking for the…Nov 16, 2021Nov 16, 2021
Minimum Binary Heap part 2, remove()In the last blog we were introduced to a minimum binary heap, potential uses, such as a queue and the basics of how to build one. In this…Nov 10, 2021Nov 10, 2021
Minimum Binary Heap part 1, insert()When dealing with data in complicated algorithms we often times need to set up a priority list of what piece of data we will run next. One…Nov 3, 2021Nov 3, 2021
Merge SortIn my last blog I went over recursion. In this blog I’m going to use recursion to write out a sorting algorithm commonly known as merge…Oct 27, 2021Oct 27, 2021
JS RecursionA recursive function is a function that calls itself. Take for example, the following function that is designed to find out if any numbers…Oct 20, 2021Oct 20, 2021
JS HoistingWhen we look at code we generally read it from top down. If we want to declare a variable, and have a function work off this variable we…Oct 14, 2021Oct 14, 2021
JS setInterval()In this blog I’m going to use vanilla JS and ‘setInterval’ to change elements on an HTML page.Oct 7, 2021Oct 7, 2021
Testing with Mocha and ChaiIn this blog I’m going to go over how to set up mocha testing for a JavaScript file. After you create a new directory, open it with your…Sep 30, 2021Sep 30, 2021
Deploying a Lightweight Express API With HerokuIn this follow-up to the last blog where we made a quick Express Js API, we are now going to deploy that same API to Heroku quickly right…Sep 23, 2021Sep 23, 2021
Starting in Express JSWhile searching for my first job in tech, I’ve been looking to expand my knowledge base. One that I’ve come across quite a bit but only…Sep 16, 2021Sep 16, 2021
