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 square matrix of n order in which two positions are filled. Fill two more positions such that a rectangle is formed by joining all points. Examples: Input: n=4 Matrix[][]= 1 0 0 1 0 0 0 0 0 0 0 0 Output: Matrix[][]= 1 0 0 1 1 0 0 1 0 0 0 0 Input:… 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 »