@@ -0,0 +1,1072 @@
+package com.fishercoder.solutions;%0A%0A/**%0A * 684. Redundant Connection%0A *%0A *  We are given a %22tree%22 in the form of a 2D-array, with distinct values for each node.%0A *  In the given 2D-array, each element pair %5Bu, v%5D represents that v is a child of u in the tree.%0A *  We can remove exactly one redundant pair in this %22tree%22 to make the result a (rooted) tree.%0A *  You need to find and output such a pair. If there are multiple answers for this question, output the one appearing last in the 2D-array. There is always at least one answer.%0A%0A Example 1:%0A Input: %5B%5B1,2%5D, %5B1,3%5D, %5B2,3%5D%5D%0A Output: %5B2,3%5D%0A Explanation: Original tree will be like this:%0A   1%0A  / %5C%0A 2 - 3%0A%0A%0A Example 2:%0A Input: %5B%5B1,2%5D, %5B1,3%5D, %5B3,1%5D%5D%0A Output: %5B3,1%5D%0A Explanation: Original tree will be like this:%0A   1%0A  / %5C%5C%0A 2   3%0A%0A Note:%0A The size of the input 2D-array will be between 1 and 1000.%0A Every integer represented in the 2D-array will be between 1 and 2000.%0A */%0Apublic class _684 %7B%0A%0A    public int%5B%5D findRedundantConnection(int%5B%5D%5B%5D edges) %7B%0A        int%5B%5D result = new int%5B%5D%7B%7D;%0A        return result;%0A    %7D%0A%0A%7D%0A

empty class for 684