mintaka
BAN USER
Comments (6)
Reputation 0
Page:
1
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
0
of 0 vote
Do we need BFS? here is just to find the distance of 2. For two persons A and B, i think we can just check A and B's friend lists and find if there are shared friends or not.
I don't quite understand the last question. if we just define the most influential person has the highest weight (the sum of weights from each connected edge), then this most influential person can be simply found by finding the largest summed weight?
Page:
1
CareerCup is the world's biggest and best source for software engineering interview preparation. See all our resources.
Assume there are no duplicates in the string.
- mintaka September 26, 2013