Given an array of positive integers we have to find number of pair of elements whose difference is smaller than average difference. Average difference is defined as (max(A)-min(A))/(n-1), where A is the array and max(A),min(A) is the maximum and minimum element of the array. Examples: Input : {9,3,10,2,3} Output : 2 Input : {7,9,5,3,1} Output : 0 RECOMMENDED: Characteristics or… Read More »
Given a matrix mat[][] of size M x N integers where M is the number of rows and N is the number of columns and a number K. The task is to sort the Kth column of the matrix. Where K <= N. Example: Input: mat[3][3] = {{ 9, 3, 4}, { 5, 2, 7}, { 3, 1,… Read More »
Given heights of n rectangles and two positive integers x and y. You start moving from the rectangle at 0th index. In one move you can perform one of the following operations: If h[ i-1 ] <= h[ i ], move from i-1 to i rectangle If h[ i-1 ] > h[ i ], move from i-1 to… Read More »
Radix Sort is the answer when elements are in the range from 1 to n^2. The idea of Radix Sort is to do digit by digit sort starting from least significant digit to most significant digit. Radix sort uses counting sort as a subroutine to sort. Radix Sort: Radix Sort basically consists of the following steps: Take the… Read More »
Sort a list in JAVA and then return the index of elements in sorted order. Examples: Input : [2, 3, 1, 4, 5] Output : [2, 0, 1, 3, 4] After sorting list becomes [1, 2, 3, 4, 5] and their index as [2, 0, 1, 3, 4] Input : [6, 4, 7, 8, 1] Output : [4,… Read More »
Given a number num (0 < num < 108), the task is to sort the digits of the number such that even indices are in ascending order and odd indices in descending order. Examples: Input: num = 1423 Output: 4132 Explanation: Sort number num in ascending order: num = 1234 Replace even indices in ascensing order: *1*2 And… Read More »
Given an array A of size N. A boolean array B consisting of N-1 elements indicates that if B[i] is 1 then A[i] can be swapped with A[i+1]. Find if A can be sorted by swapping elements. Examples: Input : A[] = {1, 6, 52, 31, 47, 60} B[] = {0, 1, 1, 1, 0} Output : A… Read More »
Given an array of N integers, where each value represents the volume of the cloud. The task is to choose the two highest volume clouds from an array and smash them together. When two clouds smash then the clouds get condense into water and it rains. If the two highest volume cloud is not equal then the volume… Read More »
Given a string s, the task is to print all permutations of a string that are in ascending order, i.e., their characters are in ascending order. Examples: Input: Cplusplus Output: Cllppssuu Out of all the permutations of the string Cllppssuu is the only string which is sorted. Input: cba Output: abc RECOMMENDED: Characteristics or features of an Algorithm… Read More »
Given an array arr[] of 2N integers, where N is any positive integer. The task is to divide the array into N pairs such that the pair sum minimizes the maximum sum of a pair i.e., the pair sums for this partition are minimum of the maximum pair sum of all possible partitions of the array. Examples: Input… Read More »
