Let’s take a look at a problem on leetcode.com, an algorithm challenge by the name of Solving Search Insert Position Algorithm. Here, we have an algo that requires us to check and manipulate an array in a way that can be tricky, so let’s check it out! The Problem As pictured above…

Today, I want to talk about a problem which, according to leetcode.com, is a fairly common interview question. This problem is known as Reverse Integer on leetcode, let’s take a look. The Problem As pictured above, the problem would like for us to write a function that takes in an integer, and…

Today I want to talk about the longest substring with repeating characters algorithm available to try at leetcode.com, and how this algo kicked my butt. I’ve been working on algorithms quite a bit lately, and have even come to enjoy them. I’m still not very good at them, but starting…

Today I want to check out an algorithm that I’ve seen a lot of sites recommend people practice for potential technical interviews. Move Zeroes is listed as an easy problem on Leetcode but it definitely can be tricky, so let’s take a look. The Problem As pictured above, the prompt asks us…

Lately, I’ve been trying to brush up on my JavaScript basics and within that, I realized I had a difficult time explaining the main differences between arrow functions and regular functions (declarations and expressions). Let’s take a look at some key differences! “This” Regular Functions A very important difference between arrow functions and…

This week, let's take a look at the Fix Point problem from binarysearch.com! The Problem Fixed Point asks us to write a function that takes in a sorted array and returns the minimum index, or i, that is equal to the value at that index. If there is no such value, then…

In a previous blog, I wrote about an effective way to sort an array. However, what if you need to find a specific element in an array after it has been sorted? …

In my job hunt, I’ve been doing a deeper dive into things like data structures and other important concepts that sometimes come up during interviews. One concept that I didn’t know much about, and am beginning to learn more, is Dynamic Programming. …

Last week, we looked at merge sorting, an algorithm used to sort an array of numbers. Today let's look at an important to know, but far less efficient way of sorting numbers, bubble sorts. Bubble sorts can have a linear time complexity, O(n) if the array is already sorted, but…