Low Level Design, Object Oriented, Graph Data Structure, Hashmap, Interview Questions.
edges, then delete those nodes too (special case). Do BFS or DFS to take this action over the entire graph. Update entity X Updation of entities is not a simple process with inter-dependent data structures. If the entity X do not have any dependency on other entities, then it is just a simple