Given an array arr[] of distinct integers of size N and an integer K, The task is to find the total no of possible pairs… Read More
Category Archives: Sorting
Given a sorted array arr[] of size N, the task is to find the number of unique elements in this array. Note: The array is… Read More
Given an array arr[] of size N, the task is to find the minimum number of operations required to make the array a permutation of… Read More
Given an array of positive integers. We are required to write a program to print the minimum product of any two numbers of the given… Read More
Given an array of positive integers. We are required to write a program to print the minimum product of any two numbers of the given… Read More
Given two arrays arr[] and brr[] containing integers. The task is to find the Kth largest product of a pair (arr[i], brr[j]). Examples: Input: arr[]… Read More
Given an array arr[] containing N lowercase English alphabets, the task is to sort this array arr[] using a linked list. Examples: Input: arr[]… Read More
Given an ascending sorted array arr[] of size N and an integer K, the task is to partition the given array into K non-empty subarrays… Read More
Given an array arr[] of size N. The task is to sort the elements in arr[] based to their Highest Degree of Expression, in descending… Read More
Given an array arr[] of size N, sorted based on the absolute value of its elements. The task is to sort this array based on… Read More
Given an array a, we have to find the minimum product possible with the subset of elements present in the array. The minimum product can… Read More
Given an array a, we have to find the minimum product possible with the subset of elements present in the array. The minimum product can… Read More
Given an array a, we have to find the minimum product possible with the subset of elements present in the array. The minimum product can… Read More
Given an array a, we have to find the minimum product possible with the subset of elements present in the array. The minimum product can… Read More
