Single Number Problem Explained from Brute to Optimal ApproachWe today will be looking at the ‘Single Number‘ problem which asks us to find the number in a given array, that appears once while all other numbers appear twice. BRUTE FORCE APPROACH We pick up every element and perform a search throughout the a...4 min read·singlenumber.hashnode.devFeb 6
Selection Sort Explained Step-By-StepSelection Sort is one of those beginner sorting algorithms which despite not being very efficient, form important foundation concepts. This article explains it in a very beginner-friendly way and even portrays some comparisons with insertion sort. AL...4 min read·easyselectionsort.hashnode.devJan 27
A Beginner's Guide to Insertion SortInsertion sort is one of those algorithms that looks simple but feels confusing when you first come across it. As a beginner, I struggled to understand how it actually works. This article walks through insertion sort step-by-step, making sure you don...4 min read·insertionsortbeg.hashnode.devJan 26