MISSING VALUE Interview Questions

6,585,363 interview questions shared by candidates

You have a n number of cities. Lets say city 1 has some information that needs to be sent to all other n-1 cities using minimal cost. Cost between each pair of cities is given. any number of cities can transmit the information once they receive the information but the overall total cost should be minimum
avatar

Software Engineer

Interviewed at Google

4.4
Nov 2, 2011

You have a n number of cities. Lets say city 1 has some information that needs to be sent to all other n-1 cities using minimal cost. Cost between each pair of cities is given. any number of cities can transmit the information once they receive the information but the overall total cost should be minimum

Write an algorithm to construct run length encodings of arbitrary strings where repeated instances of the same character get replaced with [number of times character appears] + [character]. For example, "xxxxxx" becomes "6x". It should be unambiguous and the compressed string should always be shorter.
avatar

Intern

Interviewed at Google

4.4
Mar 28, 2015

Write an algorithm to construct run length encodings of arbitrary strings where repeated instances of the same character get replaced with [number of times character appears] + [character]. For example, "xxxxxx" becomes "6x". It should be unambiguous and the compressed string should always be shorter.

You have a genealogy: 1) Describe a data structure to represent it. 2) Given any two people within the genealogy, describe an algorithm to determine if they share a common ancestor. You just need to return true/false, not all ancestors.
avatar

Software Engineer

Interviewed at Google

4.4
Mar 21, 2010

You have a genealogy: 1) Describe a data structure to represent it. 2) Given any two people within the genealogy, describe an algorithm to determine if they share a common ancestor. You just need to return true/false, not all ancestors.

Viewing 3801 - 3810 interview questions

Glassdoor has 6,585,363 interview questions. Prepare for your interview. Get hired. Love your job.