TheJobOverflow | Sprinklr OA || IIT ROORKEE || 13 - 10 - 23 || LimitLess || Split || The Matrix

Question: Sprinklr OA || IIT ROORKEE || 13 - 10 - 23 || LimitLess || Split || The Matrix

Entering edit mode

The Matrix
Given an N x N matrix and an integer K such that:
1<K≤ N
Find the maximum element of each sub-matrix of size K x K and store it
in an array P. You are given a value M, from the array P, and you have to determine the following:

The number of elements that are greater than or equal to a given value M
The minimum value greater than or equal to M
The maximum value greater than or equal to M

Note: It is guaranteed that there exists at least one element in the matrix which is greater than or equal to M.

LimitLess
You are given an array Arr of size N containing positive integers, you decide to create a new array of infinite size from the given array. You do this in the following way: For each element of the given array, you first generate all of its multiples (up to Infinity), then store them in the new array. Now you think, what the Kth smallest number in the array that you created would be. Note: The new array can contain multiple elements having the same value. For example, if the given array is [2, 3], the new array would have 2 elements having their value equal to 6 and the array would be like [2, 3, 4, 6, 6, 8, 9,...] Print the Kth smallest integer in the resulting array given the initial array A and the integer K.

Split
similar to LeetCode ---> https://leetcode.com/problems/partition-labels/description/