Given a n*m chess board. We can choose any rectangle formed by board squares and perform an inversion. Every white cell in the inverted rectangle becomes black and every black one becomes white. In the initial state the board is colored in chess style, namely every cell is either black or white and every two cells that share… Read More »
Radix Sort is the answer when elements are in the range from 1 to n^2. The idea of Radix Sort is to do digit by digit sort starting from least significant digit to most significant digit. Radix sort uses counting sort as a subroutine to sort. Radix Sort: Radix Sort basically consists of the following steps: Take the… Read More »
Given a list of n integers and consider another list which has n-1 “<” or “>” operators. Your task is to form a valid sequence by rearranging the initial list such that it follows the operator’s sequence in the final list. “vector” is a list containing integers “operators” is a list containing operators constraints: 2<=n<=1000. Examples: Input :… Read More »
Find maximum sum of array A, where k swap can be possible between array A and B. Size of array A and B is N. Examples: Input : N = 5 k = 5 A[5] = 5 6 5 6 6 B[5] = 1 2 5 4 4 Output : 28 Explanation: Sort array A in increasing order… Read More »
Given an unsorted array of integers which may contain repeated elements, sort the elements in ascending order of sum of its occurrence and print only distinct elements. If there exist more than one element whose sum of occurrences are same then, the one which is smaller, will come first. Examples: Input : arr[] = [8, 2, 4, 2,… 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 »
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 »
Mex of an array is the smallest non-negative integer that does not appear in the array. Given an array of non-negative integers, find mex of its elements. Examples : Input : arr[] = {0, 3, 1, 2} Output : 4 All integers smaller than 4, i.e. 0, 1, 2 and 3 are present in the array. Hence mex… Read More »
Given an array arr of size n, the task is to sort this array using minimum swaps. We are allowed to swap only adjacent elements. Examples: Input: arr[] = {1, 4, 3, 5, 2} Output: 4 Explaination: After 1st swap: arr[] = {1, 4, 3, 2, 5} After 2nd swap: arr[] = {1, 4, 2, 3, 5} After… Read More »
In Artificial Intelligence you will encounter this puzzle. Given below is a crypt-arithmetic problem solved. Example : SEND + MORE ——- = MONEY ——- CP + IS + FUN ——– = TRUE ——- All the different alphabets range from 0-9 and each and every alphabet should have a unique value. All the same letters have to be the… Read More »