Given an array of n integers, you need to find minimum number of below operation such that arrays becomes sorted in non-decreasing order. In a single operation you can rotate the given array clockwise one time. Print -1 if it is not possible to sort the array. Examples: Input: {8, 4, 6} Output: 2 Explanation: After applying operation… Read More »
Given an array of integers, A[] of size n with elements in range 1 to n may not consist of all the numbers from 1 to n. There are two players P1 and P2, who play in alternate turns in each turn a player can choose any index i and increase only A[i] by 1 only once in… Read More »
Given a string S of size N, the task is to sort the string without changing the place of vowels. Examples: Input: S = “example” Output: elampxe Explanation: The consonants are xmpl. After sorting it becomes lmpx. Now update the string after replacing each consonants with sorted consonants. Input: S = “Cplusplus” Output: Clluppsus Recommended: Selection Sort Approach:… Read More »
Given an array arr[] of size N (0 < arr[i] < 106), the task is to find the total count of pairs such that by dividing the largest number by the smallest number of the pair, the result is < 2. Examples: Input: arr[ ] = { 3, 12, 5, 13 } Output: 2 Explanation: The two such… Read More »
Given a binary string consisting of ‘0’ & ‘1’. You can remove any subsequence in given string but can’t pick adjacent indices. Print “POSSIBLE” if string can be sorted else print “NOTPOSSIBLE”. Examples: Input: 110 Output: POSSIBLE Explanation: If we remove characters at index 1 & 3 we are left with “1” which is sorted. Input: 101001111 Output:… Read More »
Given two arrays a and b of the same size. Find the count of total pair in array a, such that the sum of elements of pair of array a is greater than the sum of elements of the corresponding pair of array b. Example: Input: a={5,7,4,8,11} b={3,6,1,9,13} Output: 6 Explanation: The pairs are (5,7)>(3,6), (5,7)>(3,6), (5,4)>(3,1), (5,8)>(3,9),… Read More »
N objects are placed on X-axis, and coordinates are given. Starting your journey with coordinate 0, find minimum distance you need to travel to collect K objects (If multiple objects are placed on same position, you may collect some or all of them). Examples: Input: arr[] = {10, -10, -30, 20, 50}, K = 3 Output: 40 Explanation:… Read More »
Given an array of integers, in one operation a length x ( x >= 1 && x < n) can be chosen and the prefix of x length is sorted and then the suffix of (n – x) length is sorted independently of each other. The task is to check if the given array can be made unsorted… Read More »
You have a Restaurant and there is a Array nums [ ] of N people outside your restaurant. Your, waiter found out that for each valid i, the i-th person gave Ai Tip. Waiter treats person based on their Tip. I.e., a person with a higher Tip is always treated before any person with a lower Tip, waiter… Read More »
Given an array Arr[ ] that consists of N distinct integers. Check that if it is possible to sort the array in ascending order by reversing a specific segment of the array. If it is possible then print the starting and the ending position of the segment. If it is not possible then print -1. Given that the… Read More »