79291837

Date: 2024-12-18 16:42:46
Score: 0.5
Natty:
Report link

If you know the nodes(n), then create adjancency list using the edge list. That is O(n). Then do DFS which is O(V+E).

Having the right data structure makes the difference.

Reasons:
  • Low length (1):
  • No code block (0.5):
  • High reputation (-1):
Posted by: ARK