PS:Think how efficiently u can do same for an array .
Subscribe to:
Post Comments
(
Atom
)
"Coding is just like talking to a unknown girl. Once you talked to her with guts, the next time you'll never afraid",Really? Yes , try it Now !!! Everything here is for education and learning purpose only , individual holds rights on outer posts/links etc. Team Cracking The Code
Hi !!!
We are Social
Popular Posts
-
Given a number u need to find a closest palindrome of a number.. Example.. For Example 7957, the nearest palindrome is 7997 if i/p is 1999 ...
-
Question: Given a 2D array / matrix of integers. Write a program to print the elements in spiral order. Consider a matrix as show in the di... -
Given an array and an integer k, find the maximum for each and every contiguous sub array of size k.Sample Input : 1 2 3 1 4 5 2 3 6 3 [ value of k ] Sample Output : 3 3 4 5 5 5 6 This Question is Asked By Google Indirectly for...
-
This Problem Can be Solved In Two Ways 1 By Recursion by Modifying Level Order Traversal 2.By Using two Stack To Traverse the Tree in spiral...
-
A Reader send me this interestinmg problem some times back & he also confirmed that recently google asked it :) Yuckdonald's is co...
-
e.g ABBA : 0 (already a palindrome) ABB: 1 FAE: 2 FOO: 1 Simple Algorithm Will be You need to find the longest palindrome at the e...
-
A robot is located at the top-left corner of a m x n grid (marked ‘Start’ in the diagram below). The robot can only move either down or righ...
-
By starting at the top of the triangle below and moving to adjacent numbers on the row below, the maximum total from top to bottom is 23. 3 ...
-
/* The amplitude of a non-empty zero-indexed array A consisting of N numbers is defined as amplitude(A) = max { A[P] - A[Q] : 0 Writ...
3 comments :
We can use an auxiliary array.. we can copy all the elements of the mxn matrix to that auxiliary linear array and apply quick select algorithm.. complexity would be O(mxn)..
-Convert the input matrix(m*n) in to Yongify matrix [Sorted rows and colums)
- Apply Youngify 'k' times
Time Complexity: O(mnlogn) + O(mnlogm) + O(k*(m+n))
Post a Comment