Given an array arr[] and the two elements x and y, the task is to find which element(x or y) has highest occurrence in the array. If the occurrences are the same, then return the smaller element. Examples: Input: arr[] = {1, 1, 2, 2, 3, 3, 4, 4, 4, 4, 5}; x = 4, y = 5;… Read More »
Given an integer array arr[] and K, the task is to count the number of elements ‘A[i]’, such that A[i] * K is also present in the array. Note: If there are duplicates in the array, count them separately. Examples: Input : arr = { 2, 4, 5, 7, 10}, K = 2 Output : 2 Explanation :… Read More »
Given an array arr[] of n elements, write a function to search a given element x in arr[]. Examples: Input : arr[] = {10, 20, 80, 30, 60, 50, 110, 100, 130, 170} x = 110; Output : 6 Input : arr[] = {10, 20, 80, 30, 60, 50, 110, 100, 130, 170} x = 175; Output :… Read More »
Given a stock n-day price, you can only trade at most once a day, you can choose to buy a stock or sell a stock or give up the trade today, the task is to find the maximum profit can reach. Examples: Input : arr = [1,2,10,9] Output : 16 Explanation : You can buy in day 1,2… Read More »
Given an integer array arr[] and an integer K (greater than 0), the task is to count the subarray whose elements sum up to a multiple of K, else print -1. A number x is a multiple of K if there exists an integer y such that x = y*k. Remember 0 is also a multiple of K.… Read More »
Given a sorted array arr, remove the duplicates in the array itself such that duplicates appear at most twice in the given array arr and print the new length and modified array arr. Examples: Input: arr[] = {0, 0, 7, 7, 7, 7, 8, 9, 9} Output: 7 arr[] ={0, 0, 7, 7, 8, 9, 9} Explanation: The… Read More »
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 »
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 2 * (3+2+5) = 2 * 10 = 20. A subarray is a contiguous part of an array. Input: nums = [1,2,3,2] Output: 14 Explanation: The… Read More »
Given an array of distinct positive integers arr[] of length N, the task is to count all the number of pairs of indices (i , j) such that a[j]−a[i] = j−i given that i<j always. Examples: Input: 2 3 1 4 Output: 2 Input: 1 2 3 4 Output: 6 Approach-1: Simple Brute Force: We will use 2 for… Read More »
Given an integer array nums, return the sum of floor(nums[i] / nums[j]) for all pairs of indices 0 <= i, j < nums.length in the array. The floor() function returns the integer part of the division. Examples: Input: nums = [2,5,9] Output: 10 Explanation: floor(2 / 5) = floor(2 / 9) = floor(5 / 9) = 0 floor(2… Read More »
