Try it on GfG Practice Given an integer array arr[] sorted in ascending order, along with three integers: A, B, and C. The task is to transform each element x in the array using the quadratic function A*(x^2) + B*x + C. After applying this transformation to every element, return the modified array…

Given an array of strings arr[], the task is to print the strings in lexicographically sorted order. The sorting must be done such that no string is physically copied to another string during the sorting process. Examples: Input: arr[] = ["geeks", "for", "geeks", "quiz"] Output: for geeks geeks quiz…

Given an array arr[] consisting of N integers and following are the three operations that can be performed using any external number X. Add X to an array element once.Subtract X from an array element once.Perform no operation on the array element. Note : Only one operation can be performed on a…

Given a permuted array of length N of first N natural numbers, we need to tell the minimum number of swaps required in the sorted array of first N natural number to reach given permuted array where a number can be swapped with at most 2 positions left to it. If it is not possible to reach permuted…

Given an array of arr[] of positive integers that may contain many repeating elements, the task is to find the maximum difference in frequency between any two distinct elements. The element with the higher frequency must also have a greater value than the lower frequency element. Mathematically, we…

Given an array arr[] of size 'n' and a positive integer k. Consider series of natural numbers and remove arr[0], arr[1], arr[2], ..., arr[n-1] from it. Now the task is to find k-th smallest number in the remaining set of natural numbers. If no such number exists print "-1". Examples : Input: arr[] =…

Try it on GfG Practice Given an array arr[] which represents a Complete Binary Tree i.e., if index i is the parent, index 2*i + 1 is the left child and index 2*i + 2 is the right child. The task is to find the minimum number of swaps required to convert it into a Binary Search Tree. Examples: Input:…

Given an array arr[] of n integers and an integer target, the task is to find a quadruplet in arr[] whose sum is closest to target. Note: There may be multiple quadruplets with sum closest to the target, return any one of them. Examples: Input: arr[] = {4, 5, 3, 4, 1, 2}, target = 13 Output: {4, 5,…

Try it on GfG Practice Given an array of distinct integers arr[], the task is to find the surpasser count for each element of the array. A surpasser of an element in an array is any element to its right that is greater than it, i.e., arr[j] is a surpasser of arr[i] if i < j and arr[i] < arr[j]. The…

Try it on GfG Practice Given an array of distinct positive numbers, the task is to partition the array into minimum number of subsets (or subsequences) such that each subset contains consecutive numbers only. Examples: Input: arr[] = [100, 56, 5, 6, 102, 58, 101, 57, 7, 103, 59] Output: 3…

Try it on GfG Practice Given two strings pat and txt, where pat is always shorter than txt, count the distinct occurrences of pat as a subsequence in txt. Examples: Input: txt = abba, pat = aba Output: 2 Explanation: pat appears in txt as below three subsequences. [abba], [abba] Input: txt = banana,…

Try it on GfG Practice Given an array arr[], and an integer target, find all possible unique quadruplets in an array whose sum is equal to the given target value. We can return quadruplets in any order, but all the quadruplets should be internally sorted, i.e., for any quadruplets [q1, q2, q3, q4]…

Try it on GfG Practice Given an array arr[], and an integer target, find all possible unique triplets in the array whose sum is equal to the given target value. We can return triplets in any order, but all the returned triplets should be internally sorted, i.e., for any triplet [q1, q2, q3], the…

Given an array arr[] of n integers and an integer target, the task is to find any quadruplet in arr[] such that it's sum is equal to the target. Note: If there are multiple quadruplets with sum = target, return any one of them. Examples: Input: arr[] = {2, 4, 6, 8, 1, 3}, target = 15 Output: {2, 4,…

We are given an unsorted array of integers in the range from 0 to n-1. We are allowed to swap adjacent elements in array many number of times but only if the absolute difference between these element is 1. Check if it is possible to sort the array.If yes then print "yes" else "no". Examples: Input :…

Given an array with n distinct elements, convert the given array to a form where all elements are in range from 0 to n-1. The order of elements is same, i.e., 0 is placed in place of smallest element, 1 is placed for second smallest element, ... n-1 is placed for largest element. Input: arr[] = {10,…

We have discussed bucket sort in the main post on Bucket Sort . Bucket sort is mainly useful when input is uniformly distributed over a range. For example, consider the problem of sorting a large set of floating point numbers which are in range from 0.0 to 1.0 and are uniformly distributed across…

Try it on GfG Practice Given two arrays of equal size n and an integer k. The task is to permute both arrays such that sum of their corresponding element is greater than or equal to k i.e a[i] + b[i] >= k. The task is to print "Yes" if any such permutation exists, otherwise print "No". Examples :…

Given two arrays a[] and b[] of the same length, containing the same values but in different orders (with no duplicates). The task is to make b[] identical to a[] using the minimum number of swaps. Examples: Input: a[] = [3, 6, 4, 8], b[] = [4, 6, 8, 3] Output: 2 Explanation: To make b[] identical…

Given a set of elements, find which permutation of these elements would result in worst case of Merge Sort. Asymptotically, merge sort always takes O(n Log n) time, but the cases that require more comparisons generally take more time in practice. We basically need to find a permutation of input…

Try it on GfG Practice Consider a big party where a log register for guest's entry and exit times is maintained. Find the time at which there are maximum guests in the party. Given the Entry(Entry[]) and Exit (Exit[]) times of individuals at a place. Note: Entries in the register are not in sorted…

Try it on GfG Practice We are given an array that contains 1 to n elements, our task is to sort this array in an efficient way. We are not allowed to simply copy the numbers from 1 to n. Examples : Input : arr[] = {2, 1, 3}; Output : {1, 2, 3} Input : arr[] = {2, 1, 4, 3}; Output : {1, 2, 3, 4}…

Try it on GfG Practice Given two arrays arr1[] and arr2[] of size m and n, the task is to sort arr1[] such that the relative order among the elements matches the order in arr2[]. For elements not present in arr2[], append them at the end in sorted order. Example: Input: arr1[] = {2, 1, 2, 5, 7, 1,…

Try it on GfG Practice Given an array of numbers of size n. It is also given that the array elements are in the range from 0 to n2 - 1. Sort the given array in linear time. Examples: Since there are 5 elements, the elements can be from 0 to 24. Input: arr[] = {0, 23, 14, 12, 9} Output: arr[] = {0,…

Try it on GfG Practice Given an unsorted array arr[]. Find the subarray arr[s...e] such that sorting this subarray makes the whole array sorted. Note: If the given array is already sorted then return [0, 0]. Examples: Input: arr[] = [10, 12, 20, 30, 25, 40, 32, 31, 35, 50, 60] Output: [3, 8]…

Try it on GfG Practice Three arrays of same size are given. Find a triplet such that maximum - minimum in that triplet is minimum of all the triplets. A triplet should be selected in a way such that it should have one number from each of the three given arrays. If there are 2 or more smallest…

Try it on GfG Practice Given an array arr[] of n integers and an integer target, the task is to find the sum of triplets such that the sum is closest to target. Note: If there are multiple sums closest to target, print the maximum one. Examples: Input: arr[] = [-1, 2, 2, 4], target = 4 Output: 5…

Try it on GfG Practice Given an array arr[] of size n and an integer sum, the task is to check if there is a triplet in the array which sums up to the given target sum. Examples: Input: arr[] = [1, 4, 45, 6, 10, 8], target = 13 Output: true Explanation: The triplet [1, 4, 8] sums up to 13 Input:…

Try it on GfG Practice Given an integer array arr[] of size n, find the inversion count in the array. Two array elements arr[i] and arr[j] form an inversion if arr[i] > arr[j] and i < j. Note: Inversion Count for an array indicates that how far (or close) the array is from being sorted. If the array…

Try it on GfG Practice Given an array arr[] consisting of only 0s, 1s, and 2s. The task is to sort the array, i.e., put all 0s first, then all 1s and all 2s in last. This problem is the same as the famous "Dutch National Flag problem". The problem was proposed by Edsger Dijkstra. The problem is as…

Try it on GfG Practice Given an array arr[] of n integers where arr[i] represents the number of chocolates in ith packet. Each packet can have a variable number of chocolates. There are m students, the task is to distribute chocolate packets such that: Each student gets exactly one packet.The…

Try it on GfG Practice Given an array arr[] of integers. In one operation you can choose an index i, and increment the element arr[i] by 1. The task is to return the minimum number of operations needed to make every value in the array arr[] unique. Examples: Input: arr[] = [3, 2, 1, 2, 1, 7] Output:…

Given a 1-indexed array of integers numbers that is already sorted in non-decreasing order, find two numbers such that they add up to a specific target number. Let these two numbers be numbers[index1] and numbers[index2] where 1 <= index1 < index2 <= numbers.length. Return the indices of the two…

Try it on GfG Practice Given two sorted arrays, the task is to merge them in a sorted manner. Examples: Input: arr1[] = { 1, 3, 4, 5}, arr2[] = {2, 4, 6, 8} Output: arr3[] = {1, 2, 3, 4, 4, 5, 6, 8} Input: arr1[] = { 5, 8, 9}, arr2[] = {4, 7, 8} Output: arr3[] = {4, 5, 7, 8, 8, 9} Table of Content…

We are given an array of strings, we need to sort the array in increasing order of string lengths. Examples: Input : {"GeeksforGeeeks", "I", "from", "am"} Output : I am from GeeksforGeeks Input : {"You", "are", "beautiful", "looking"} Output : You are looking beautiful A simple solution is to write…

Given an array of n positive integers, where each integer can have up to 106 digits, print the array elements in ascending order. Assumption: There are no leading zeros. Examples Input: arr[] = [54, 724523015759812365462, 870112101220845, 8723] Output: 54 8723 870112101220845 724523015759812365462…

We are given an array of n distinct numbers. The task is to sort all even-placed numbers in increasing and odd-placed numbers in decreasing order. The modified array should contain all sorted even-placed numbers followed by reverse sorted odd-placed numbers. Note that the first element is considered…

Try it on GfG Practice Given an array of integers, sort the array (in descending order) according to count of set bits in binary representation of array elements. Note: For integers having same number of set bits in their binary representation, sort according to their position in the original array…

Try it on GfG Practice An interval is represented as a combination of start time and end time. Given a set of intervals, check if any two intervals intersect. Examples: Input: arr[] = [[1, 3], [5, 7], [2, 4], [6, 8]] Output: True Explanation: The intervals {1, 3} and {2, 4} overlap Input: arr[] =…

Try it on GfG Practice Given an array of integers arr[], sort the array according to the frequency of elements, i.e. elements that have higher frequency comes first. If the frequencies of two elements are the same, then the smaller number comes first. Examples: Input: arr[] = [5, 5, 4, 6, 4] Output:…