Given an array of size N, print the index of the distinct element from the array, provided the array has only one distinct element and rest other elements are same. Examples: Input: Arr[]={10,10,10,10,20} Output: Distinct Element found at index : 4 Input: Arr[]={7,7,7,0,7,7,7,7} Output: Distinct Element found at index : 3 Approach: Linearly traverse through the array and… Read More »
Given an array arr[] of n positive integers and q queries, in which each query have an integer k. For each query, the task is to output the minimum size of subarray whose binary representation of each elements if concatenated will have at least k number of set bits. If no such array exist, print -1. Examples: Input… Read More »
Given an array of N elements, the task is to find the minimum value of K such that Bitwise XOR of K with all array elements is minimum Input: arr[] 16 12 20 18 Output: 16 Explanation: 16^16+12^16+20^16+18^16 =26 Minimum sum Explanation: Check every bit of the numbers and count number of one and zero For minimum sum,… Read More »
Two numbers: m and n are given. The size of these numbers is 32-bit long. You are also given two-bit positions: i and j. You have to set all bits between i and j in m equal to n, i.e., means that n becomes a substring of m located at i and starting at j. Examples: Input :… Read More »