The min-product of an array is equal to the minimum value in the array multiplied by the array’s sum. For example, the array [3,2,5] (minimum value is 2) has a min-product of Read more →
Java Programs
25 postsGiven a sorted array and a value x, we need to find floor and ceil value of x in the array using improved binary search technique. Floor value is the largest element Read more →
Given a sorted rotated array, the task is to find index of minimum element of the array. Following solution assumes that all elements are distinct. Examples: Input : arr[] = {5, 6, 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 Read more →
Given an Array consisting of N integers, Count the number of contiguous subarrays where each element in the subarray appears 2 or more times. Examples : Input : n = 3 arr Read more →