Goldman Sachs Interview Report
- 0of 0 votes
Answers1) There are two hashmaps with string as keys and double as values. Construct a method which takes in these two hashmaps and returns another data structure which returns difference between the values with corresponding keys.
- chethan March 06, 2010| Report Duplicate | Flag | PURGE
Goldman Sachs Software Engineer / Developer Algorithm - 0of 0 votes
AnswersA point in 3-d is defined by (x,y,z). Distance d between any two points (X,Y,Z) and (x,y,z) is d= Sqrt[(X-x)^2 + (Y-y)^2 + (Z-z)^2].
- chethan March 06, 2010
Now there are a million entries in a file, each entry is some point in space, in no specific order. Given any point (a,b,c) find the nearest 10 points to it. How would you store the million points and how would you retrieve those 10 points from that data structure.| Report Duplicate | Flag | PURGE
Goldman Sachs Software Engineer / Developer Algorithm
CareerCup is the world's biggest and best source for software engineering interview preparation. See all our resources.