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 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 »
There is an array containing prices of n tickets. A number m is defined as the size of a subsequence S of tickets. Each element in the subsequence covers a continuous range of integers. In other words, when the elements in S are sorted, the absolute difference between any two consecutive elements j and j+1 is either 0… Read More »
Sorting is one of the most fundamental thing in all programming languages. One of the Simple Approach is to use sort() function in Kotlin. In Kotlin any Data types of an Array can be sorted using sort() function. In sort() function there are two types : Without passing parameters. With passing parameters. 1. Without passing parameters : In… Read More »
Given an integer k and array of length N find the min no of move to make all the elements divisible by k. In one move you can go one of the below operation. 1. For any index i we can do a[i] = a[i] + p 2. p = p + 1 The value of p starts… Read More »
Given an array arr[ ] of N non-negative integers, the task is to sort these integers according to sum of their digits. Examples : Input : 12 10 102 31 15 Output : 10 102 12 31 15 Input : 12 10 14 31 15 199 Output : 10 12 31 14 15 199 12 => 1 +… Read More »
Given an array of size N. The task is to find the maximum and the minimum element of the array using the minimum number of comparisons. Examples: Input : A[]={4,2,-1,5,0,-5,7,3,6} Output : Min Element -5 Max Element 7 Input : A[]={3,8,4,2,6,9} Output : Min Element 2 Max Element 9 Approach: The idea is to use the Two Pointer… Read More »