Most of the string based problems either revolve around a prefix or a suffix. A prefix is a character or a sequence of characters that occur in the beginning of a string. In this problem we try to find the longest common prefix in an array of strings.

Introduction to Boolean Algebra with examples

Given an array of positive integers with some zeroes. You need to move all the zeroes to the end without changing the relative order of non-zero elements. A unique solution makes this problem really easy to understand.

Binary Search is a fabulous concept that can be used to narrow down the search range. One such problem on LeetCode explores this domain where you need to find the correct position to insert the element in a sorted array

[Leetcode] – Numbers Smaller than current

[Leetcode] – Number of Good Pairs Solution

Using binary search to find the first and last index of a target element in a sorted array.

[Hackerrank] – Camel Case Solution

[Hackerrank] – Super Reduced Strings

[Hackerrank] - Number Line Jumps Solution Two kangaroos 🦘 start from different positions on a number line. We need to determine if they can reach at the same position at any given point of time. The problem can be easily solved by using basic maths.

Delete a node in Linked List. In this post we discuss how you can delete a node from the beginning, end and somewhere in the middle. All of this involves playing with pointers.

Given an array with some values, you need to equalize them with the minimum number of operations. An operation is counted as incrementing all values by 1, 2 or 5 except 1.

[Hackerrank] - Making Anagrams Solution Given two strings, determine the total number of characters to be deleted such that they become anagrams. We use counting sort to create buckets of each character frequency to derive an optimal solution.

[Hackerrank] - Repeated String Solution Given a string that is repeated infinite number of times, find the count of letter 'a' in the first 'n' characters. This problem requires a bit of logical thinking and can be evaluated using mathematics.

The idea behind a standard queue can be used to develop other flavors which can help in problem solving. Different uses cases can take advantage of the FIFO principle. This post touches the surface of these data structures.

[Leetcode] : Find All Duplicates in an Array Solution Given an array of integers, find the elements that appear twice. The main challenge of this problem is to solve it without using any extra space.

You are in charge of birthday cake candles at a party. However, when the child blows, only the tallest candles are put out. Read this post to find how many tallest candles are present on the cake with a full implementation of code and video explanation.

Given an array of strings strs, you need to group all the anagrams together. You can return the answer in any order. You can either group by sorting the characters or by frequency. The latter gives you a better time complexity.

[Leetcode] - Search in a Rotated Sorted Array Solution Read this post to find the index of the target element using a modified version of the binary search technique. If the element is not found, you simply need to return a -1.

[Leetcode] - Two Sum Solution, A very important question for your interviews as it tests out your logical thinking capabilities. Read the post to learn 3 different methods of solving this problem.