d4d8397e5f
Adds some of the code I generated while studying for a role transfer at Google using the fantastic resource, InterviewCake.com. This work predates the mono-repo. I should think of ways to DRY up this code and the code in crack_the_coding_interview, but I'm afraid I'm creating unnecessary work for myself that way.
38 lines
1,015 B
Python
38 lines
1,015 B
Python
class Node(object):
|
|
def __init__(self, value, children=[]):
|
|
self.value = value
|
|
self.children = children
|
|
|
|
|
|
################################################################################
|
|
# Solution
|
|
################################################################################
|
|
def trip_time(node):
|
|
s = []
|
|
result = 0
|
|
s.append((node.value, node))
|
|
while s:
|
|
p, node = s.pop()
|
|
if not node.children:
|
|
result = max(result, p)
|
|
for x in node.children:
|
|
s.append((p + x.value, x))
|
|
return result
|
|
|
|
|
|
################################################################################
|
|
# Tests
|
|
################################################################################
|
|
tree = Node(
|
|
0,
|
|
children=[
|
|
Node(5, children=[Node(6)]),
|
|
Node(2, children=[
|
|
Node(6),
|
|
Node(10),
|
|
]),
|
|
Node(3, children=[Node(2, children=[Node(11)])]),
|
|
])
|
|
|
|
assert trip_time(tree) == 16
|
|
print("Tests pass!")
|