Given an array (with all elements greater than 0), create a non-decreasing array by swapping 2 elements if their gcd(Greatest Common Factor) is equal to the minimum element of the array. You have to print “YES” if this is possible, and if not print “NO”. Examples: Input: a[] = {6,2,4,8,12} Output: YES Explaination: Swap a[1] and a[2] and… Read More »
Given three arrays start[], duration[], amount[] of length N. A person can make money of amount[i] working for the time period [start[i], start[i]+duration[i]] on task i. Maximum amount of money a person can make from the N tasks. Note: Person can work on only one task at a time. Example : Input : start[] = {15, 10, 30,… Read More »
Given start and end time of all the cars in a given interval, find the maximum time gap in which no car travels. The start timings are given in sorted order. Examples: Input: start[] = { 1, 2, 6 } end[] = { 3, 5, 9 } Output: 1 Explanation: The first car travels from time unit 1… Read More »
Mex of an array is the smallest non-negative integer that does not appear in the array. Given an array of non-negative integers, find mex of its elements. Examples : Input : arr[] = {0, 3, 1, 2} Output : 4 All integers smaller than 4, i.e. 0, 1, 2 and 3 are present in the array. Hence mex… Read More »
Given an array arr of size n, the task is to sort this array using minimum swaps. We are allowed to swap only adjacent elements. Examples: Input: arr[] = {1, 4, 3, 5, 2} Output: 4 Explaination: After 1st swap: arr[] = {1, 4, 3, 2, 5} After 2nd swap: arr[] = {1, 4, 2, 3, 5} After… Read More »
Given an array arr[] and the two elements x and y, the task is to find which element(x or y) has highest occurrence in the array. If the occurrences are the same, then return the smaller element. Examples: Input: arr[] = {1, 1, 2, 2, 3, 3, 4, 4, 4, 4, 5}; x = 4, y = 5;… Read More »
Given n strings in any order. Sort all the strings (lexicographically), but if a string is present completely as a prefix in another string, then string with larger length should come first. Examples: Input : 3 cap apple captain Output : apple captain cap Explanation: cap is present in captain as a prefix, so string : captain being… Read More »
Given an array arr[] of N points. The task is to sort these points according to it’s distance from the origin. Examples: Input: arr[] = { {5,0}, {4,0}, {3,0}, {2,0}, {1,0} } Output: (1,0) (2,0) (3,0) (4,0) (5,0) distance bw (0,0) and (1,0) = 1 distance bw (0,0) and (2,0) = 2 distance bw (0,0) and (3,0) =… Read More »
Given a sorted rotated array, the task is to find index of minimum element of the array. Following solution assumes that all elements are distinct. Examples: Input : arr[] = {5, 6, 1, 2, 3, 4} Output : 2 Minimum element in the array is 1, hence index will be 2 Input : arr[] = {2, 3, 4,… Read More »
There are many fundamental and advanced sorting algorithms. All sorting algorithms are problem-specific, which means they work well on some specific problem but do not work well for all the problems. All sorting algorithms apply to specific kinds of problems. Some sorting algorithms apply to a small number of elements, some are suitable for floating point numbers, some… Read More »