Given an n x n matrix, where every row and column is sorted in non-decreasing order. Find the kth smallest element in the given 2D array.
Input:k = 3 and array =
11, 22, 33, 44
55, 65, 75, 85
94, 99, 97, 98
12, 13, 19, 10
Output: 13
Explanation: The 3rd smallest element is 13
import random k=5 L=[[11,22,33,44], [55,65,75,85], [94,99,97,98], [12,13,19,10]] Q=[] for i in L: Q=Q+i Q=sorted(Q) print(Q[k])
Input : k = 4 and array =
11, 22, 33, 44
55, 65, 75, 85
94, 99, 97, 98
12, 13, 19, 10
Output:
19
Input : k = 7 and array =
11, 22, 33, 44
55, 65, 75, 85
94, 99, 97, 98
12, 13, 19, 10
Output:
44
Illustration of Output :
More Q
- Find the majority element appearing more than n/2 times
- Return an array of the squares of each number.
- Highest factor in addition.
- Find the empty packets(0) of chocolate and push it to the end of the conveyor belt(array).
- Every element in array appears twice.Find that single one.
- Find the duplicate letters in string. Same to do in dictionary way.
- Find minimum number of edits (operations) required to convert ‘str1’ into ‘str2’.
- Return the maximum number you can get by changing at most one digit.
- Sed Commands – Ranges of lines.
- Find the kth smallest element in the given 2D array.
- Find all elements that appear more than [n/3] times.
- Write a function to return true if s2 contains the permutation of s1.
- Sort the array into a wave like array.
- Re-order array, such that
nums[0] < nums[1] > nums[2] < nums[3].... - Given the coordinates, return true if the four points construct a square.
- Minimum Distance Between Words of a String.
- Return the shortest distance between these two words.
- Write a program to find the n-th ugly number.
- Check if array could become Non – Decreasing array.
- Find the minimum area of a rectangle that can be formed from given points.