add 2492

Author: fishercoder1534

paginated_contents/algorithms/3rd_thousand/README.md

@@ -28,6 +28,7 @@
 | 2520 | [Count the Digits That Divide a Number](https://leetcode.com/problems/count-the-digits-that-divide-a-number/)                                                                                 | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2520.java)                                       | [:tv:](https://youtu.be/7SHHsS5kPJ8) | Easy                      ||
 | 2515 | [Shortest Distance to Target String in a Circular Array](https://leetcode.com/problems/shortest-distance-to-target-string-in-a-circular-array/)                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2515.java)                                       || Easy                                 ||
 | 2496 | [Maximum Value of a String in an Array](https://leetcode.com/problems/maximum-value-of-a-string-in-an-array/)                                                                                 | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2496.java)                                       || Easy                                 ||
+| 2492 | [Minimum Score of a Path Between Two Cities](https://leetcode.com/problems/minimum-score-of-a-path-between-two-cities/)                                                                                                             | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2492.java)                                       || Medium                               |Union Find
 | 2467 | [Convert the Temperature](https://leetcode.com/problems/convert-the-temperature/)                                                                                                             | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2469.java)                                       || Easy                                 ||
 | 2455 | [Average Value of Even Numbers That Are Divisible by Three](https://leetcode.com/problems/average-value-of-even-numbers-that-are-divisible-by-three/)                                         | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2455.java)                                       || Easy                                 ||
 | 2433 | [Find The Original Array of Prefix Xor](https://leetcode.com/problems/find-the-original-array-of-prefix-xor/)                                                                                 | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2433.java)                                       | [:tv:](https://youtu.be/idcT-p_DDrI) | Medium                    ||

src/main/java/com/fishercoder/solutions/thirdthousand/_2492.java

@@ -0,0 +1,59 @@
+package com.fishercoder.solutions.thirdthousand;
+
+import java.util.ArrayList;
+import java.util.HashSet;
+import java.util.List;
+import java.util.Set;
+
+public class _2492 {
+    public static class Solution1 {
+        public int minScore(int n, int[][] roads) {
+            UnionFind uf = new UnionFind(n);
+            //union all roads first
+            for (int[] road : roads) {
+                uf.union(road[0], road[1]);
+            }
+            //now call find() to completely union all connected cities
+            for (int i = 1; i <= n; i++) {
+                uf.find(i);
+            }
+            //now we'd like to find all cities that are connected to city 1
+            Set<Integer> nodes = new HashSet<>();
+            int startIndex = uf.find(1);
+            for (int i = 2; i <= n; i++) {
+                if (uf.find(i) == startIndex) {
+                    nodes.add(i);
+                }
+            }
+            int minScore = Integer.MAX_VALUE;
+            for (int[] road : roads) {
+                if (nodes.contains(road[0]) || nodes.contains(road[1])) {
+                    minScore = Math.min(minScore, road[2]);
+                }
+            }
+            return minScore;
+        }
+
+        static class UnionFind {
+            int[] ids;
+
+            public UnionFind(int n) {
+                this.ids = new int[n + 1];
+                for (int i = 1; i <= n; i++) {
+                    this.ids[i] = i;
+                }
+            }
+
+            public int find(int x) {
+                if (x != ids[x]) {
+                    ids[x] = find(ids[x]);
+                }
+                return ids[x];
+            }
+
+            public void union(int x, int y) {
+                ids[find(x)] = find(y);
+            }
+        }
+    }
+}

src/test/java/com/fishercoder/thirdthousand/_2492Test.java

@@ -0,0 +1,27 @@
+package com.fishercoder.thirdthousand;
+
+import com.fishercoder.solutions.thirdthousand._2492;
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _2492Test {
+    private static _2492.Solution1 solution1;
+
+    @BeforeEach
+    public void setup() {
+        solution1 = new _2492.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(5, solution1.minScore(4, new int[][]{{1, 2, 9}, {2, 3, 6}, {2, 4, 5}, {1, 4, 7}}));
+    }
+
+    @Test
+    public void test2() {
+        assertEquals(1885, solution1.minScore(6, new int[][]{{4, 5, 7468}, {6, 2, 7173}, {6, 3, 8365}, {2, 3, 7674}, {5, 6, 7852}, {1, 2, 8547}, {2, 4, 1885}, {2, 5, 5192}, {1, 3, 4065}, {1, 4, 7357}}));
+    }
+
+}