Minimum K product
You need to return the product modulo 10^9 + 7.
If the given array is [1, 4, 2 ,6, 3] and K = 3. Then answer will be 6 by taking the product of integers 1, 2, and 3.
Can you solve it in less than O(N * logN) time complexity?
The first line of input contains a single integer T, representing the number of test cases or queries to be run. Then the T test cases follow. The first line of each test case contains two positive integers 'N' and 'K', where N is the size of the given array 'ARR' and K is the number of elements of the array of which minimum product is to be found. The next line contains 'N' single space-separated positive integers representing the elements of the array.
For each test case, print an integer denoting the minimum product of K integers modulo 10^9+7 in a single line.
You do not need to print anything. It has already been taken care of. Just implement the given function.
1 <= T <= 10 1 <= N <= 10^5 1 <= ARR[i] <= 10^9 1 <= K <= N Time Limit: 1 sec
Longest Subarray With Zero Sum
Merge Two Sorted Arrays Without Extra Space
Ninja And The Strictly Increasing Array
Negative To The End
Sort 0s, 1s, 2s