struggleyb
BAN USER
Comments (5)
Reputation 80
Page:
1
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
2
of 2 vote
Should use kd-tree
- struggleyb February 03, 2013Comment hidden because of low score. Click to expand.
6
of 6 vote
This is vertex cover problem:
en.wikipedia.org/wiki/Vertex_cover
Comment hidden because of low score. Click to expand.
0
of 2 vote
How to just two pass of pre-order traversal.
In the first pass, we calculate the total weight of the whole tree.
In the second pass, we try to remove each subtree and calculate the diff, track the max diff, that's all...
Comment hidden because of low score. Click to expand.
0
of 0 vote
We can make sure that, 4 bytes boundary must be a start byte of some character. So, we start at (currentPrt - firstPtr) % 4 bytes before current pointer, check the character and move it until we reach current pointer.
- struggleyb November 12, 2012Page:
1
CareerCup is the world's biggest and best source for software engineering interview preparation. See all our resources.
Use a modified version of BFS, which start from the lowest value.
- struggleyb February 03, 2013