Sorting: Check if the array is Arithmetic Progression
Problem Statement: You are given an unsorted array. You need to check if the array is AP. An array is considered as AP if the difference…
Sorting: Check if two arrays are equal or not
Problem Statement: You are given 2 arrays, you need to check if the array are same or not Example: Input: a[] = [1, 2, 3, 4, 5] b[] = [5, 4,…
Sorting: Check if reversing sub array make the array sorted
Problem Statement: You are given an array. You need to check if reversing any sub array, can make the array sorted or not. Example: Input :…
Sorting: Given an array, minimize sum of product of consecutive pairs
Problem Statement: You are given an array. You need to re arrange an array in such a way that, when multiply an element with its alternative…
Sorting: Given an array, you need to check if it has contiguous integers
Problem Statement: Given an array that has duplicate elements, You need to check if the array has continuous integers. Example: Input = [5, 4,…
Sorting: Check if any interval completely overlaps other
Problem Statement: You are given an interval. You need to check if any interval completely overlaps other. Example: Input: {{1, 3}, {1, 7},…
Sorting: Merge 2 sorted arrays
Problem Statement: You are given 2 arrays, you need to merge 2 sorted arrays Example: Input: a = [1, 2, 3, 4, 4, 5] b = [6, 6, 7, 8, 9]…
Sorting: Minimum increment to make array unique
Problem Statement: You are given an array. You need to choose a index and increment that value by 1. You need to return the number of…
Sorting: Given 2 arrays, return minimum number of platforms required for a railway station
Problem Statement: You are given 2 arrays arrival[], departure[] of trains. You need to get the minimum number of platforms required, so that…
Sorting: Given an array, count inversions
Problem Statement: You are given an array, you need to find the inversion count. 2 array elements a[i] and a[j] form an inversion if a[i] >…