Explained Solution to a HackerRank Problem — For today’s algorithm, we will insert a node at the head of a singly linked list. Here is the challenge that I picked from HackerRank: Given a pointer to the head of a linked list, insert a new node before the head. The next value in the new node should…

A Common Interview Question Asked at Many Companies — This week, we will cover another popular technical interview question from LeetCode’s Top Interview Questions List; Reverse Linked List: Reverse a singly linked list. Example: Input: 1->2->3->4->5->NULL Output: 5->4->3->2->1->NULL This article will not give many details about linked lists, but here is a very quick refresher: Linked lists are data…

Explained Solution to a Popular Interview Question — Last week, I was asked to solve one of the most common questions on a technical interview for a software engineer role and I wanted to share my solution with you in today’s article. The challenge was asking to write a program that capitalizes the first letter of every word…

Explained With a Problem From LeetCode — For today’s algorithm, I picked the binary search which is one of the most commonly asked topics in technical interviews. The problem named binary search from LeetCode will be used to explain this concept: Given a sorted (in ascending order) integer array nums of n elements and a target value…

Challenge Picked From LeetCode’s Top Interview Questions List — Today, we will work on Remove Duplicates from Sorted Array algorithm from LeetCode’s Top Interview Questions List: Given a sorted array nums, remove the duplicates in-place such that each element appears only once and returns the new length. Do not allocate extra space for another array, you must do this…

Top Interview Questions List — LeetCode — In today’s blog post, I will build an algorithm that validates given inputs as anagrams. Here is one of the most classic interview challenge named Valid Anagram which I picked from LeetCode’s Top Interview Questions List: Given two strings s and t, write a function to determine if t is…

A Challenge from HackerRank’s Interview Preparation Kit — For this week’s algorithm, I picked a problem named Sock Merchant from HackerRank. I slightly adjusted the challenge as we will not be using a second parameter for the number of socks: Given an array of integers representing the color of each sock, determine how many pairs of socks with…

From LeetCode’s Top Interview Questions List — This week’s algorithm; Two Sum, is picked from LeetCode’s Top Interview Questions list: Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target. You may assume that each input would have exactly one solution, and you may…

Explained the Solution of an Exercise in Eloquent JavaScript — I picked an exercise called “recursion” from the third chapter of the Eloquent Javascript book for this week’s algorithm (3rd edition, chapter 3; Functions). We will write a recursive function that takes a whole number as its single parameter and defines whether the given number is even or odd by…