2065. Maximum Path Quality of a Graph

Description

There is an undirected graph with n nodes numbered from 0 to n - 1 (inclusive ). You are given a 0-indexed integer array values where values[i] is the value of the i^th node. You are also given a 0-indexed 2D integer array edges, where each edges[j] = [u<sub>j</sub>, v<sub>j</sub>, time<sub>j</sub>] indicates that there is an undirected edge between the nodes u<sub>j</sub> and v<sub>j</sub>, and it takes time<sub>j</sub> seconds to travel between the two nodes. Finally, you are given an integer maxTime.

Read more »

164. Maximum Gap

Description

Given an integer array nums, return the maximum difference between two successive elements in its sorted form. If the array contains less than two elements, return 0.

Read more »
0%