Low Level Design, Object Oriented, Graph Data Structure, Hashmap, Interview Questions.
that Graphs are represented as adjacency lists which are nothing but hash maps from one node to another node or a set of nodes. For e.g. if we have a hash map a -> b and another from b ->[c], then we have a graph with nodes a, b and c and edges b/w them a -> b -> [c]. Let us define 2 classes ‘Node’