Algorithms, Data Structures, Competitive Coding, and problems from LeetCode with complete Solution Approach, Pseudocode, and Explanation.
Transpose or swap the rows and columns of the given matrix – 2D array in JavaScript. Matrix swapping takes place diagonally. 🟢 Easy 🧩 Pattern – Arrays Example JS code to transpose a square matrix Since a square matrix has the same number of rows and columns, we only need… Read More »Transpose a Matrix – JavaScript
For the given string, determine if the open and closed brackets/parentheses are balanced are not, i.e. for every open bracket there must be a closed bracket in the same order. Return true if balanced and false if unbalanced. 🟢 Easy 🧩 Pattern – Stack Example Solution approach This can be… Read More »Check if parentheses are balanced – JS
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