Round 1:
1.Design a Data Structure supporting 3 queries a)push b)pop c) find
minimum
2.Given post order of a BST find whether each node of the tree(except
leaf) has only 1 child or not.
eg 5
\
7
/
3
/
2
is correct as each node has only 1 child.
Round 2:
1.Given a sorted array a and a sum k print all pairs of indexes i and
j such that a[i]+a[j]=k.
2.Given a matrix that is row and column wise sorted give an algo for
finding count of the total no of -ve nos.
Round 3:
1.Given a matrix consisting of nos you can print the max length of
sequence possible where in a sequence each consecutive nos have a diff
of +1 or -1.
eg 3 5 7 3
4 5 8 1
6 4 5 2
here sequence is 3
4 5
4 5
2.Give a data structure that supports following queries a)insert
b)delete c)ispresent d)print all elements
3.Given a infinite supply of n cylinders where each cylinder is
specified by weight of 02,weight of n2,total weight ,
now u need some minimum quantity of o2 and n2 by selecting
cylinders and your aim is make it so that u have min total weight.
output the minimum total weight .
Round 4:
1.Given 2 sorted arrays find there median.
2.Consider column of ms excel the start with A,B....Z,AA
Now u r given column no u need to print its name
3.Given 2 arrays.Imagine you are making bst from each array.u need to
tell whether 2 bsts will be identical or not without actually
constructing the tree.
eg 1 2 3
1 3 2
will construct the same tree
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
For more options, visit https://groups.google.com/groups/opt_out.
