Grokking Graph Algorithms for Coding Interviews
Ask Author
Back to course home

0% completed

Vote For New Content
Hugh Parry
Fun 1 liner to not use in an interview

Hugh Parry

Feb 7, 2025

class Solution:     def findSmallestSetOfVertices(self, n: int, edges: List[List[int]]) -> List[int]: return [node for node in range(n) if node not in set(to_node for _, to_node in edges)]

0

0

Comments
Comments

On this page