package leetcode;

/**
 * https://leetcode.com/problems/find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance/
 */
public class Problem1334 {
    public int findTheCity(int n, int[][] edges, int distanceThreshold) {
        // TODO
        return 0;
    }

    public static void main(String[] args) {
        Problem1334 prob = new Problem1334();
    }
}

@@ -363,16 +363,312 @@
 1334();%0A
+        System.out.println(prob.findTheCity(4, new int%5B%5D%5B%5D%7B%0A            %7B0, 1, 3%7D, %7B1, 2, 1%7D, %7B1, 3, 4%7D, %7B2, 3, 1%7D,%0A        %7D, 4)); // 3%0A        System.out.println(prob.findTheCity(4, new int%5B%5D%5B%5D%7B%0A            %7B0, 1, 2%7D, %7B0, 4, 8%7D, %7B1, 2, 3%7D, %7B1, 4, 2%7D, %7B2, 3, 1%7D, %7B3, 4, 1%7D,%0A        %7D, 2)); // 0%0A
     %7D%0A%7D%0A

Update problem 1334