Overview In this particular LeetCode problem, Plus One, I would have to approach it with a crafty approach. The problem states You are given a large integer represented as an integer array digits, where each digits[i] is the ith digit of the integer. The digits are ordered from most significant…

The intersection of two lines posted in leetcodes did not seem that complex. Based on the title my initial thought was to find an intersecting x and y-axis, fortunately, I was so wrong. It was similar to the most frequent number problem. The question in Leetcode states “Given two integer…

One problem I tried avoiding was the missing number problem. I did not have confidence in myself to find the actual missing integer in the array. However with a bit of research and resources available to me online I was able to stomach this problem. This problem is number 268…

During my daily Leetcode challenge I ran into an interesting problem, the Majority of elements. I was required to take the most frequent number in the array. The question states, “Given an array nums of size n, return the majority element”. …

Introduction In this algorithm challenge on LeetCode, I decided to tackle the Excell Column Sheet Problem. This problem required me to take an alphabet string that represented integer values, for example, the letter “A” would represent 1, “B” would represent 2, and so forth. However, there is a particular trick…

I was tackling a few problems from LeetCode and stumbled upon a problem that resonated with me. The Single Number problem, this particular question requires me to single out the non-repeating digit. My first initial thought process was to sort the numbers in the array. Once completed I created a…

The Problem Many have stumbled upon the infamous palindrome algorithm question. The main goal of the palindrome question is to check whether or not the words are the same backward and if so return true. Seems simple however most of my test case in Leetcode did not pass. …

What is Breadth-First Search When working with Binary Search Tree as a programmer you will be asked or required to traverse through the nodes. One concept you want to have in your arsenal is the “Breadth-First Search” technique. The basic method to this is to start from the root node…

What is Insertion Sort?