Drawing an Interaction FBD | Dataford Interview Questions

Given a situation, draw an FBD of all the interactions.

Represent each interaction as an undirected connection between two named entities. Implement the function below to produce an adjacency-list representation of the free-body diagram. Include every entity, remove duplicate interactions, and sort each entity's neighbors alphabetically.

Input: A list of two-element lists [entity_a, entity_b].

Output: A dictionary mapping each entity to a sorted list of entities it interacts with.

Constraints

0 <= interactions.length <= 10^4
Each interaction contains exactly two non-empty strings
Entity names contain at most 100 characters
Entity names are case-sensitive
Duplicate interactions may appear in either order

Function Signature

def build_fbd(interactions):

Your question is Drawing an Interaction FBD. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem