t.deepak.iitg
BAN USER
Comments (8)
Reputation 0
Page:
1
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
0
of 0 vote
what does he mean by testing? dows he wanted to construct the tree back?
- t.deepak.iitg September 04, 2012Comment hidden because of low score. Click to expand.
0
of 0 vote
this is maximum subarray problem you have to do using dynamic programming refer cormen
- t.deepak.iitg September 04, 2012Comment hidden because of low score. Click to expand.
0
of 0 vote
what is a railway portal system first of all
- t.deepak.iitg September 04, 2012Comment hidden because of low score. Click to expand.
0
of 0 vote
first of all your assumpiton is wrong
- t.deepak.iitg September 04, 2012Comment hidden because of low score. Click to expand.
0
of 0 vote
that way takes O(n) space and n is very large. implement a hash function for size m if collision occurs maintain a list
- t.deepak.iitg September 04, 2012Comment hidden because of low score. Click to expand.
0
of 0 vote
yes i think the same too
- t.deepak.iitg September 04, 2012Comment hidden because of low score. Click to expand.
0
of 0 vote
we can recursively check if it has more than 2 child then return false
- t.deepak.iitg September 04, 2012Page:
1
CareerCup is the world's biggest and best source for software engineering interview preparation. See all our resources.
i think your answer is correct
- t.deepak.iitg September 05, 2012