MediumCoding

Sales Path

1Give yourself 5 minutes

2Answer out loud, not in your head

3Then compare with the answer below

Reference answer

To find the cheapest sales path, we can use a recursive approach, specifically a depth-first search (DFS). The base case is a leaf node (no children), which has a cost of 0. For any other node, we recursively calculate the cheapest cost for each of its children and take the minimum among them. We then add the current node's cost to this minimum child cost to get the total cheapest cost through this node. This process is repeated for all branches to find the overall cheapest path.

Hiring now

Get the interview, not just the prep

landed applies to roles like these for you, on each company’s own site, with answers written for the role.

Get 5x interviews10 free auto-applies. No card.

Or practice this question first

Next question

Calculate the trapped rainwater between bars in a given array.
Find a triplet in an array with a given sum.
Print all combinations of numbers from 1 to n that sum to n.
Find the number of rotations in a circularly sorted array.
Find all permutations of a given string.
Check if two given binary trees are identical.