Given N*N 2D matrix of 1's and 0's, all rows are sorted .
Find the row which contain's max no. of 0's.
Tuesday, September 14, 2010
substring comparison
Give efficient algorithm to find whether one string is substring of other string.
How to print binary tree vertically?
Given a binary tree, give efficient algorithm to do vertical level order traversal.
Longest increasing subsequence
How to find longest increasing subsequence ?.
Sequence is series of integers like 4,5,-1,2,3 ...
Sequence is series of integers like 4,5,-1,2,3 ...
Subscribe to:
Posts (Atom)