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] >…
Sorting: Given an array, return the number of steps required to make array elements same
Problem Statement: You are given an array, you need to return the minimum number of steps to make the array elements same. You can increment…
Sorting: Get union of 2 sorted arrays
Problem Statement: You are given 2 sorted arrays, You need to return the union of union of 2 arrays such that the new array will have all…
Sorting: Given an array, sort the elements alternatively
Problem Statement: You are given an array, rearrange the array in such a way that first max, first min, second max, second min etc Example:…
Stack: Given an expression, get the minimum bracket reversal to make the expression balanced
Problem Statement: You are given an expression with “{” and “}” and might be balanced. Find the minimum number of…
Stack: Delete middle element of a stack
Problem Statement: Given a stack, you need to delete the middle element. You should not use any additional data structure. Example: Input: [1,…
Stack: Delete consecutive same words in a sequence
Problem Statement: You are given a array of strings. You need to find the number of words after pairwise deletion. Example: Input: arr[] =…
Stack: Given a string with balanced brackets, you need to print the bracket number
Problem Statement: You are given a sting s, containing bracket and character. You need to find the bracket number for each bracket in the…