Problem Description Given two integer arrays, A and B of size N and M, respectively. Your task is to find all the common elements in both the array. Each element in the result should appear as man...

Problem Description Given two arrays of integers A and B of size N each, where each pair (A[i], B[i]) for 0 <= i < N represents a unique point (x, y) in a 2-D Cartesian plane. Find and retu...

Problem Description Given two arrays of integers A and B of size N each, where each pair (A[i], B[i]) for 0 <= i < N represents a unique point (x, y) in 2D Cartesian plane. Find and return ...

Problem Description We are given an array of [x,y] co-ordinates. Write a function which returns the minimum area of any rectangle that can be formed using any 4 points in this array. The sides of ...

Problem Description Given a sorted array of distinct integers A and an integer B, find and return how many pair of integers ( A[i], A[j] ) such that i != j have sum equal to B. Solution public c...

Problem Description Given an array of positive integers A and an integer B, find and return first continuous subarray which adds to B. (First sub-array means the sub-array for which starting index...

Problem Description Given an array of size N, where A[i] represents the height of the ith wall, pick any two walls such that maximum water can be stored between them. Solution We start from the ...

Problem Description Given N distinct sorted elements, check if there exists a pair (i,j) such that A[i] - A[j] = k and k>0. (i!=j) Solution Two important thing in question is to figure out wh...

Problem Description Given N distinct sorted elements, check if there exists a pair (i,j) such that A[i] + A[j] = k, i!=j. Solution The brute force approch is to check all pairs - O(N^2) A better...

Problem Description Given unsorted array of N distinct elements, find kth index position of its sorted form. (k will start from 0) Note: We cannot modify the array and we cannot use extra space. ...