Given a 2D array with rows sorted in ascending order. Find the median of the whole 2D array.
For example,
Given a 2D array with rows sorted in ascending order. Find the median of the whole 2D array.
For example,
Given two sorted arrays find the element which would be kth in their merged and sorted combination.
For example, A=[1, 1, 2, 3, 10, 15] and B=[-1, 2, 3, 4, 6, 7] then k=8th smallest element would be 4 as it appears in 8th position of the merged sorted array=[-1, 1, 1, 2, 2, 3, 3, 4, 6, 7, 10, 15].
Permutation means arranging all the members of a set into some sequence or order, or if the set is already ordered, rearranging (reordering) its elements, a process called permuting. These differ from combinations, which are selections of some members of a set where order is disregarded. For example, written as tuples, there are six permutations of the set {a,b,c}, namely: (a,b,c), (a,c,b), (b,a,c), (b,c,a), (c,a,b), and (c,b,a). These are all the possible orderings of this three element set.
Given an unbalanced binary tree, write code to select k sample node at random