Given an array arr[] consisting of binary digits 0 and 1, determine the minimum number of swaps to push 0s towards one end and 1s to the other end of the array. Swapping of only adjacent elements is allowed. Examples: Input : arr={0, 1, 0, 1} Output : 1 We can get {0, 0, 1, 1} by swapping… Read More »
Given an array containing weights of gifts, and an integer representing maximum weight a box can contain. Each box carries at most 2 gifts at the same time, provided the sum of the weight of those gifts is at most limit of box. The task is to find the minimum number of boxes required to carry all gifts.… Read More »
Given an Integer Stack in Java, sort the stack in increasing order (Ascending Order) Examples: Input : Stack: [10, 2, 16, 5, 9, 1] Peek: 1 Output : Stack: [1, 2, 5, 9, 10, 16] Peek: 16 Recommended: Design and Implement Special Stack Data Structure Approach: The idea is, pop every element from the original stack and compares… Read More »
Given an infinite stream of integers, find the k’th largest element at any point of time. It may be assumed that 1 <= k <= n. Example: Input: stream[] = {10, 20, 11, 70, 50, 40, 100, 5, …} k = 3 Output: {-1, -1, 10, 11, 20, 40, 50, 50, …} Extra space allowed is O(n).… Read More »
Given an array arr[] of N non-negative integers, the task is to sort these integers according to the sum of letters required to represent them. Examples: Input: arr[] = {12, 10, 31, 18} Output: 12 31 10 18 12 -> one + two -> 3 + 3 = 6 31 -> three + one -> 4 + 3… Read More »
Given an array arr1[] of size n, so firstly we have to reverse each element of an array, and store each of that reversed element in new arr2[] and then sort. Examples: Input : arr1[]={45,67,98,10} Output : after sorting=>{1,54,76,89} Explanation : arr1[]={45,67,98,10} so after reversing each element: arr2[]={54,76,89,1} after sorting arr2[] becomes: arr2={1,54,76,89} Input : arr1[]={20,56,90,19,42,67} Output :… Read More »
Given a an array of even size N. The task is to find that is it possible to reorder it in such way so that the sum of left half is not equal to the sum of right half. Print -1 if not possible else print the required array. Examples: Input: arr = {1, 2, 2, 1, 3,… Read More »
Given an array arr[] of N dates in the form of “dd-mm-yyyy”, the task is to sort these dates in ascending order. Examples: Input: arr[] = { “25-08-1996”, “03-08-1970”, “09-04-1994” } Output: 03-08-1970 09-04-1994 25-08-1996 Input: arr[] = { “14-02-1972”, “01-01-2001”} Output: 14-02-1972 01-01-2001 A simple solution that comes to our mind is to delete all ‘-‘ from… Read More »
Given an integer K and an array of integers, you have to find whether is it possible to reduce the array to a single element equal to k or not. You can do the following operation: 1) Pick any two elements a[i] and a[j] in the array such that i!=j 2) Remove both the elements a[i] and a[j]… Read More »
Given an array arr[] of N strings, the task is to sort these strings according to the numbers of matches required to represent them. Examples: Input: arr[] = { “123”, “46”, “8”, “88” } Output: 8 46 123 88 8 -> 7 sticks 46 -> 10 sticks 123 -> 12 sticks 88 -> 14 sticks Input: arr[] =… Read More »
