Low Level Design, Object Oriented, Graph Data Structure, Hashmap, Interview Questions.
multiple hash maps corresponding to each relation. Graph — Create new node(s) with id as X.uid. Create edges to other entities for each type of relationship. X.uid is a combination of X.id and X.type because id value may not be unique across all types. Delete an entity X and associated