🔗LC977 🟢 Easy 🧩 Pattern – Arrays and Loops Given an integer array nums sorted in non-decreasing order, return an array of the squares of each number sorted in non-decreasing order. Example Solution We use two pointers left and right and keep pushing the largest values first to the end… Read More »Squares of a Sorted Array – 977
When we start thinking of using an array, we think of iterations and other manipulations, and in JavaScript we often use the array.map() function to iterate through the array content. This post is about a special array method called array.some() that can be used to check if any one element… Read More »Iterating arrays with array.some() in JavaScript
Given an array of size n, find the majority element. The element that appears more than ⌊ n/2 ⌋ times in the array. Note: Input will be a non-empty and unsorted array. Example Solution Approach 1. Sorting On sorting the given array, the element occurring more than [n/2] times will… Read More »Majority Element in an Array – LeetCode
In this post we’ll be solving a simple problem using an Array of Structures. Problem Statement: Read an input of [N] API calls and find their Average, Each call has three timestamps [T1, T2, T3] and we need to give separate average for each. Example Output Explanation, in the above… Read More »Array of Structures – API Problem
Given an array containing a mix of even and odd numbers, and we need to perform Even Odd Separation. In this post we’ll see how to separate even and odd numbers in a single iteration using two pointers. Example Solution Approach Method 1 To separate even-odd elements, we can take… Read More »Even Odd Separation O(N) Single Iteration
Given an array of numbers consisting of only zeroes and ones, and we need to separate 0s and 1s. This problem can be solved in many ways like sorting and performing basic swapping but I learned a method to do all of this in a single iteration. So, let’s do… Read More »Separate 0s and 1s – O(N) Single Iteration