Question Link : https://leetcode.com/problems/graph-valid-tree/

Difficulty: Medium

Premium: True

Question

You have a graph of n nodes labeled from 0 to n - 1. You are given an integer n and a list of edges where edges[i] = [ai, bi] indicates that there is an undirected edge between nodes …

Continue reading

Question Link : https://leetcode.com/problems/minimum-score-of-a-path-between-two-cities/

Difficulty: Medium

Premium: False

Question

You are given a positive integer n representing n cities numbered from 1 to n. You are also given a 2D array roads where roads[i] = [ai, bi, distancei] indicates that there is a bidirectional road between cities …

Continue reading