Teads Problem

hi everyone !

first sorry for my english ^^

i want some informations for the teads problem “find the node to start information propagation ,with a minimum cost”.

I encountred two problem with test 1 and the test 2.

test 1 : link : [[0, 1], [1, 2], [2, 3], [2, 4]]
expected solution : node 2 for a cost of 2
my solution : node 1 for a cost of 2

there is the same cost, but considering my solution wrong :confused:

test 2 : link : [[0, 1], [1, 2], [1, 4], [2, 3], [4, 5], [4, 6]]
expected solution : node 2 for a cost of 3
my solution : node 1 for a cost of 2

there is best solution then expect and also considering wrong :confused:

I cant upload images, so you can draw the graph and see by your self.

some one have explanation or i miss something ?

3 posts were merged into an existing topic: Teads Sponsored Puzzle