Low Level Design, Object Oriented, Graph Data Structure, Hashmap, Interview Questions.
a->c, c->[a], b->[d], d->[a] The adjacency list for the Graph would look like as follows: (a : b, c) (b : [d]) (c : [a]) (d : [a]) Add a new entity X and associated relationships Hash Map — Create new hash map(s) with key as X.id. If there are multiple relationships emerging out of X, then create