Understanding the problem One of the more common problems you might encounter in a software interview involves finding what is commonly referred to as the “maximum sub-array” within a longer array. Take a look at this example here: We want to write a function that looks at an array and discovers which slice…

I applied for a company this week that was hiring for a Python position. Python was the first language I ever learned and I felt very comfortable with the syntax, but I hadn’t yet used it to build a project. …

I’ve encountered the term Immediately Invoked Function Expression (IIFE) a ton while preparing for my interviews. …

I’ve been obsessed (in a healthy way) with figuring out how to use my time in the most efficient way possible for as long as I can remember. Sometimes “work smarter not harder” is more easily said than done — there are a number of variables that can throw off…

Once upon a time, there was a magic bridge… The magic bridge was made up of round, magic stepping stones, and each magic stepping stone had a magic rope connected to it that pointed in one direction. …

Let’s talk data In JavaScript, there are seven “primitive” data types… String, Number, Boolean, BigInt, Symbol, undefined, and null … and two “structural” types… Object and Function As you probably already know, each data type has some inherent functionality. …

We’ll be doing a step-by-step breakdown of three famous sorting algorithms. While they aren’t the most optimal sorting algorithms regarding time complexity, understanding how they work can help tremendously with mastering common problem-solving techniques such as sliding-windows and multiple pointers. Before go into each specific algorithm, let’s first go over…