First Round - Take-home Coding Challenge - 2 hrs to solve 1 question.

Round 2 - Video call/Interview through KARAT - 1 hr to solve 3 questions:

• 1-minute self-introduction
• Interviewer asked me to explain the code I wrote for the previous round.
• Proceeded to the coding challenge.

Question 1: Given a pair of all nodes in the graph, find the number of nodes with 0 children and 1 child.

Question 2: Suppose we have some input data describing a graph of relationships between parents and children over multiple generations. The data is formatted as a list of (parent, child) pairs, where each individual is assigned a unique integer identifier.

parentChildPairs1 = [ (1, 3), (2, 3), (3, 6), (5, 6), (5, 7), (4, 5), (4, 8), (4, 9), (9, 11), (14, 4), (13, 12), (12, 9) ]

Sample input and output:

hasCommonAncestor(parentChildPairs1, 3, 8) => false hasCommonAncestor(parentChildPairs1, 5, 8) => true

Write a function that takes the graph, as well as two of the individuals in our dataset, as its inputs and returns true if and only if they share at least one ancestor.

Take Home Test - 2 hrs to solve:

Packages are sent to our shipping center via a series of autonomous delivery carts, each of which moves packages on a one-way route. Using input that provides the (directed) steps that each cart takes as pairs, write a function that identifies all the start locations and a list of possible ending locations for each start location.

The output keys and values should be printed in sorted order.

In this diagram, starting locations are at the top and destinations are at the bottom - i.e. the graph is directed exclusively downward.