Google Interview Question for Android Engineers

Country: United States

Comment hidden because of low score. Click to expand.
1
of 1 vote

Looking for interview experience sharing and coaching?

Visit AONECODE.COM for ONE-TO-ONE private lessons by FB, Google and Uber engineers!

SYSTEM DESIGN Courses (highly recommended for candidates of FB, LinkedIn, Amazon, Google & Uber etc.)
ALGORITHMS (conquer DP, Greedy, Graph, Advanced Algorithms & Clean Coding),
latest interview questions sorted by companies,
mock interviews.

Our students got hired from G, U, FB, Amazon, LinkedIn, MS and other top-tier companies after weeks of training.

Email us aonecoding@gmail.com with any questions. Thanks!

SOLUTION:
Assume it's looking for the minimum overall distance for everyone to get a different bike.

``````def shorstOverallDistance(people, bikes):#coordinations of N people and N bikes
if not people:
return 0
size = len(people)
shortest_distance = None
for i in size:
for j in size:
distance = distanceBetween(people[i], bikes[j]) + shortestOverallDistance(people[:i] + people[i+1:], bikes[j] + bikes[j+1:])
if not shortest_distance or shortest_distance > distance:
shortest_distance = distance
return distance

def distanceBetween(p1, p2): #apply any custom distance function
#...``````

Comment hidden because of low score. Click to expand.
0
of 0 vote

It seems to be a NP-full problem such as Travelling, because we must visit every bike just one time and total path must be minimal.

We can design some greedy algorithm and select minimal path each time, but it will not be exact answer

Name:

Writing Code? Surround your code with {{{ and }}} to preserve whitespace.

Books

is a comprehensive book on getting a job at a top tech company, while focuses on dev interviews and does this for PMs.

Videos

CareerCup's interview videos give you a real-life look at technical interviews. In these unscripted videos, watch how other candidates handle tough questions and how the interviewer thinks about their performance.