FPEvalRepoPublic/LeetCodeMetaData

1{2  "id": 3687,3  "name": "longest-special-path",4  "difficulty": "Hard",5  "link": "https://leetcode.com/problems/longest-special-path/",6  "date": "2025-01-04",7  "task_description": "You are given an undirected tree rooted at node `0` with `n` nodes numbered from `0` to `n - 1`, represented by a 2D array `edges` of length `n - 1`, where `edges[i] = [ui, vi, lengthi]` indicates an edge between nodes `ui` and `vi` with length `lengthi`. You are also given an integer array `nums`, where `nums[i]` represents the value at node `i`. A special path is defined as a downward path from an ancestor node to a descendant node such that all the values of the nodes in that path are unique. **Note** that a path may start and end at the same node. Return an array `result` of size 2, where `result[0]` is the length of the **longest** special path, and `result[1]` is the minimum number of nodes in all possible **longest** special paths. **Example 1:** **Input:** edges = [[0,1,2],[1,2,3],[1,3,5],[1,4,4],[2,5,6]], nums = [2,1,2,1,3,1] **Output:** [6,2] **Explanation:** In the image below, nodes are colored by their corresponding values in `nums` The longest special paths are `2 -> 5` and `0 -> 1 -> 4`, both having a length of 6. The minimum number of nodes across all longest special paths is 2. **Example 2:** **Input:** edges = [[1,0,8]], nums = [2,2] **Output:** [0,1] **Explanation:** The longest special paths are `0` and `1`, both having a length of 0. The minimum number of nodes across all longest special paths is 1. **Constraints:** `2 <= n <= 5 * 104` `edges.length == n - 1` `edges[i].length == 3` `0 <= ui, vi < n` `1 <= lengthi <= 103` `nums.length == n` `0 <= nums[i] <= 5 * 104` The input is generated such that `edges` represents a valid tree.",8  "test_case": [9    {10      "label": "Example 1",11      "input": "edges = [[0,1,2],[1,2,3],[1,3,5],[1,4,4],[2,5,6]], nums = [2,1,2,1,3,1]",12      "output": "[6,2] "13    },14    {15      "label": "Example 2",16      "input": "edges = [[1,0,8]], nums = [2,2]",17      "output": "[0,1] "18    }19  ],20  "constraints": [21    "2 <= n <= 5 * 104",22    "edges.length == n - 1",23    "edges[i].length == 3",24    "0 <= ui, vi < n",25    "1 <= lengthi <= 103",26    "nums.length == n",27    "0 <= nums[i] <= 5 * 104",28    "The input is generated such that edges represents a valid tree."29  ],30  "python_template": "class Solution(object):\n    def longestSpecialPath(self, edges, nums):\n        \"\"\"\n        :type edges: List[List[int]]\n        :type nums: List[int]\n        :rtype: List[int]\n        \"\"\"\n        ",31  "java_template": "class Solution {\n    public int[] longestSpecialPath(int[][] edges, int[] nums) {\n        \n    }\n}",32  "metadata": {33    "func_name": "longestSpecialPath"34  }35}