Binary search is a better searching algorithm that follows the Divide and Conquer method on the condition that we have sorted/ordered data. Binary Search Algorithm We have three variables that drive the search i.e. start, end, and middle. As their name says start will be at the start=0 of the… Read More »Binary Search in JavaScript
Linear search, also known as sequential search, is an algorithm where we look for an item in a list by comparing each item one by one. It’s a straightforward algorithm that we use every day. Example Given an array arr = [4, 1, 3, 2] and we are looking for… Read More »Linear Search in JavaScript
🟢 Easy 🧩 Pattern – Arrays and Hashmap Given an array of distinct integers and a target sum, return an array of unique pairs of numbers which add up to the target sum. Each pair should be represented as an array containing only two numbers. Example Solution
🔗LC169 🟢 Easy 🧩 Pattern – Arrays and Hashmap Given an array nums of size n, return the majority element. The majority element is the element that appears more than ⌊n / 2⌋ times. You may assume that the majority element always exists in the array. Example Solution
🟢 Easy 🧩 Pattern – Arrays Given an array which contains even and odd numbers, we need to seperate them by putting the odd numbers first followed by the even numbers. Example Solution The oddPointer variable is used to keep track of the index where the next odd number should… Read More »Separate Even and Odd numbers in an array
🟢 Easy 🧩 Pattern – Arrays Given an array which contains only zeroes and ones, we need to seperate them by putting the zeroes first followed by the ones. Example Solution The zeroPointer variable is used to keep track of the index where the next zero should be placed.