# Tag Archives: array-merge

Given 3 arrays (A, B, C) which are sorted in ascending order, we are required to merge them together in ascending order and output theโฆ Read More
Given 3 arrays (A, B, C) which are sorted in ascending order, we are required to merge them together in ascending order and output theโฆ Read More
Given 3 arrays (A, B, C) which are sorted in ascending order, we are required to merge them together in ascending order and output theโฆ Read More
Given 3 arrays (A, B, C) which are sorted in ascending order, we are required to merge them together in ascending order and output theโฆ Read More
Given two positive integers, N and M, and an array arr[ ] consisting of (N + M) integers such that the first N elements areโฆ Read More
Given an array A[] of size N, the task is to sort the array in increasing order using In-Place Merge Sort. Examples: Input: A =โฆ Read More
Given an array arr[][] consisting of N lists representing N transactions, the task is to merge the given lists of transactions in the order ofโฆ Read More
Given two arrays A[] and B[] consisting of N and M integers respectively, the task is to calculate the maximum prefix sum that can beโฆ Read More
Given an array arr[] consisting of N integers, the task is to count the number of greater elements on the right side of each arrayโฆ Read More
Given an array A[] of size N (1 โค N โค 105), the task is to calculate the number of swaps required to sort theโฆ Read More
Given an array arr[] consisting of 2* N elements in the form of { a1, a2, โฆ, aN, b1, b2, …, bN }, the taskโฆ Read More
Given two sorted arrays A[] and B[] of size N, the task is to check if it is possible to merge two given sorted arraysโฆ Read More
Given two sorted arrays, arr[], brr[] of size N, and M, the task is to merge the two given arrays such that they form aโฆ Read More
Implement Merge Sort i.e. standard implementation keeping the sorting algorithm as in-place. In-place means it does not occupy extra memory for merge operation as in theโฆ Read More
This is an extension of the median of two sorted arrays of equal size problem. Here we handle arrays of unequal size also. Examples:  Input:โฆ Read More