If you’re studying for your coding interviews, you may come across this “easy” coding challenge. “Balanced” strings are those who have equal quantity of ‘L’ and ‘R’ characters. Given a balanced string s split it in the maximum amount of balanced strings. Return the maximum amount of splitted balanced strings…

This article will cover the algorithm of how to find the correct position to insert a given element into a sorted array in Javascript. First we will set up two variables: one to hold the potential index of the element, and a boolean value to reflect whether we have found…

The Binary Search Tree is a staple of the coding interview. I will review how to solve this problem in javascript. “Given a Binary Search Tree and a Target element, see if the Tree includes the Target element”: We will be using a helper function that also takes in the…

One of the most popular coding questions involves the two number sum. “Given an non-empty array of distinct integers and a target sum, find two numbers in the array that add up to the target sum.” Or it’s possible that no numbers add up to the target sum. …

Another popular interview question for the coding interview is to validate if a second array is a subsequence of the first array. For example, if the first array is: [1, 2, 3, 4, 5], and the second array is: [1, 2, 3], your function should return “true.” Let’s tackle this…

So you’ve begun studying algorithms for you coding interview. Best of luck to you and your future endeavors! But first you must tackle the Binary Tree. A Binary Tree is a structure that has one root node, which then branches into two left and right nodes. These are called children…