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 »
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 »
You are given two strings string1 and string2. Your task is to find length of longest consecutive occurrences of second string that occurs in first string. Examples: Input: string1=”AAACBBAAAA”, string2=”A” Output: 4 Explanation: We will get AAA(0:3) and then AAAA(6:10) as 4 is greater than 3, answer is 4. Input: string1=”ABBABBABBAAAA”, string2=”ABB” Output: 9 Approach: Initially find length… 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 »
Given a string S, the task is to sort odd indices in ascending order and even indices in descending order of the string. Examples: Input: S = “Cplusplus” Output: Cululspsp Explanation: Sort string S in ascending order: S = “Cululspsp” Replace odd indices in ascensing order and even indices in descending order. Input: S = “plusplus” Output: lulupsps… Read More »
Given an array A[ ] of N segments find any point common to maximum number of segments and also find the number of segments which it is common to. The segments are in the form [L, R]. Examples: Input: N = 3, A[ ] = {{2, 4}, {-1, 3}, {-5, 1}} Output: Point 0 is common to 2… Read More »
You are given a string s consisting only of characters ‘a’ and ‘b’. You can delete any number of characters in s to make s balanced. s is balanced if there is no pair of indices (i,j) such that i < j and s[i] = ‘b’ and s[j]= ‘a’. Return the minimum number of deletions needed to make… Read More »
