Algorithms Union of Two Arrays In this article, we have explained different approaches to find Union of Two Arrays and provided implementations in C++, Java and Python.

Algorithms 3 Sum Smaller Problem The 3 sum smaller problem is an interesting algorithm problem that we shall be solving in this article. This is an extension of the 3 Sum Problem. In this, we have to select 3 different elements from an array such that the sum is less than a target.

Algorithms 4 Array Sum equal to Zero (4Sum II) In this article, we have explored insightful approaches / algorithms to find elements in 4 arrays whose sum is equal to zero. This is an extension of 4 SUM PROBLEM.

Algorithms 2 Sum Closest: Find 2 elements with sum closest to target We have explained how to solve the 2 Sum Closest problem that is Find 2 elements with sum closest to a target efficiently. We have explained 3 different approaches which involves the use of Binary Search and Two Pointer technique.

Algorithms 4 Sum problem In this article, we have explored an insightful approach/ algorithm to find the 4 elements in an array whose sum is equal to the required answer (4 Sum problem). This concept finds many uses in computational geometry.

Algorithms Implement K stacks in one array In this article, we have present two approaches to design K stacks in one array. The challenge is to efficiently store the elements to use all available space in the array and maintain the time complexity of stack operations.

Algorithms Closest 3 Sum problem (Find all triplets close to the given sum) In this article, we have explored an insightful approach/ algorithm to find the 3 elements in an array whose sum is equal to or close to the required answer. This is an extension of the 3 Sum problem where the resulting sum needed not be exact.

Algorithms Intersection of two arrays We have explored several approaches to find Intersection of two arrays efficiently. This involve techniques like sorting, binary search, hash map and much more.

Algorithms Majority Element in an array We have discussed algorithmic techniques to find the majority element in an array. The brute force algorithm takes O(N^2) time while the most efficient algorithm can do it in O(N) time.

Algorithms Two Pointer Technique in Array We have explained the Two Pointer Technique in array which is used to solve a vast range of problems efficiently. Problems include Reversing an array and Find if a pair with given sum exists in a sorted array.

Algorithms Block Swap Algorithm [for Array Rotation] This article discusses Block Swap Algorithm. It is used to rotate an array by any number of positions with a Time Complexity of O(N) and Space Complexity of O(1).

Algorithms Move even number to front of array We have explained two efficient approaches to Move even number to front of array using Hoare's Partition and Lomuto Partition.

Algorithms Lomuto Partition Scheme We have explained the Lomuto partition scheme, which is used in the famous Quicksort algorithm. It is an algorithm to partition an array into two parts based on a given condition.

Algorithms Reversal Algorithm to rotate an array We have discussed Reversal algorithm. It is widely used for rotating arrays. This algorithm is specifically useful for rotating array by any number of places because it efficiently does the operation in O(N) time and O(1) auxiliary space.

Data Structures Array Interview Questions [MCQ with answers] This is the list of Interview Questions based on Array Data Structure. You must practice these Multiple Choice Questions. This will help you master Array Coding Questions for Interviews at companies like Google and Microsoft.

Algorithms Boyer Moore majority vote algorithm [Majority Element] Boyer Moore voting algorithm is used to find the majority element among the given sequence of elements which occurs more than N/2 times, in linear time complexity and constant space complexity.

Software Engineering Process of deleting an array in C++ We have explained how to delete an array or delete an element in an array in C++. We can covered the case of static and dynamic memory allocated array along with the basics of array.

Algorithms Move negative elements to front of array This article focuses on the algorithm to move the negative elements of an array to the front. This can be solved by the two-pointer approach.

Algorithms Bit Array [Explained with example] Bit Array is a data structures that compactly stores Boolean values or bits in the form of an array. The bits can be 0 or 1 only. Each bit in the bit array is independent.

Algorithms Least frequent element in an array Given an array of N elements, our task is to find the least frequent element present in it. In this article, we are going to talk about 3 methods to solve this problem along with their implementation.

List of Mathematical Algorithms Find index such that sum of left sub-array = right sub-array (Equilibrium Index) For a given array, we need to find an index such that sum of left sub-array = right sub-array also called the Equilibrium Index. We solve this using brute force approach O(N^2) and using prefix array in linear O(N) time.

Algorithms Finding LCM of an array of numbers Find the LCM of the given array of positive numbers. We have explored 2 approaches: one using GCD and other without using GCD.

Algorithms Finding 2 elements with difference k in a sorted array This article discusses how to check the existence of and find 2 elements with difference k in sorted array. We have explored 3 approaches and solved it in linear time O(N).

Algorithms Next Larger / Smaller element in Array (using Monotonic Queue) In this problem, we are given an array and our task is to find the next larger/ smaller element for each element in the array. We have covered brute force approach and Monotonic Queue.

Algorithms 3 Sum problem (Triplets with given Sum) Given an array, we need to find if there is a triplet in the array whose sum is equal to a given value. If such a triplet is present, we need to print it and return true. Else, return false.