2192. All Ancestors of a Node in a Directed Acyclic Graph

class Solution: def getAncestors(self, n: int, edges: List[List[int]]) -> List[List[int]]: visited = set() adjList = defaultdict(set) parents = defaultdict(set) # Create adjacency list for (a, b) in edges:...