Given, a sorted array of elements and we need to find all the pairs of elements that add up equally to a given target sum number, this can be done usually done using two loops, like a brute force method where all the elements are compared with every other element… Read More »Target Sum – Single Iteration O(N)
The Binary Search Algorithm, a simple and faster search. But on one condition, we need a sorted array or sort the given array before we perform a binary search. Why Binary Search? We can use linear search for smaller numbers but, when having hundreds, and thousands, to compare, it would… Read More »Binary Search Algorithm
Yes, we are doing it today. The all-time famous interview question, Do you know how to reverse a Linked List? Well turns out, it isn’t that difficult and it’s all about logic and pointers, okay let’s get started. Alright, I already wrote a post explaining the basic operations and structure… Read More »Reverse a Linked List
The Fibonacci Series is a standard programming problem scenario, and we can obtain the series or nth Fibonacci number using both iterative as well as recursive. In this post, we’ll compare, discuss both methods and their complexities. Fibonacci Series – Example The principle behind this order/sequence is very simple The… Read More »Fibonacci Series – Iterative vs Recursive
Given, a String of Characters might be a mix of numbers, alphabets, and other special characters and we need to find the maximum occurring character and to do this we need to count the occurrence of each and every character and then the greatest one will be our answer. Examples… Read More »Maximum Occurring Character in a String
Today, I found a problem where we need to find the sum of numbers in a string, the string will be a mix of alphabets, numbers, and special characters, and usually, this can be solved by iterating through each character and adding all the numbers. Example Solution Approach Given a… Read More »Sum of Numbers in a String