@@ -0,0 +1,1309 @@
+package com.fishercoder.solutions;%0A%0Aimport com.fishercoder.common.classes.TreeNode;%0A%0A/**%0A * 1123. Lowest Common Ancestor of Deepest Leaves%0A *%0A * Given a rooted binary tree, return the lowest common ancestor of its deepest leaves.%0A * Recall that:%0A * The node of a binary tree is a leaf if and only if it has no children%0A * The depth of the root of the tree is 0, and if the depth of a node is d, the depth of each of its children is d+1.%0A * The lowest common ancestor of a set S of nodes is the node A with the largest depth such that every node in S is in the subtree with root A.%0A *%0A * Example 1:%0A * Input: root = %5B1,2,3%5D%0A * Output: %5B1,2,3%5D%0A * Explanation:%0A * The deepest leaves are the nodes with values 2 and 3.%0A * The lowest common ancestor of these leaves is the node with value 1.%0A * The answer returned is a TreeNode object (not an array) with serialization %22%5B1,2,3%5D%22.%0A *%0A * Example 2:%0A * Input: root = %5B1,2,3,4%5D%0A * Output: %5B4%5D%0A *%0A * Example 3:%0A * Input: root = %5B1,2,3,4,5%5D%0A * Output: %5B2,4,5%5D%0A *%0A * Constraints:%0A * The given tree will have between 1 and 1000 nodes.%0A * Each node of the tree will have a distinct value between 1 and 1000.%0A * */%0Apublic class _1123 %7B%0A    public static class Solution1 %7B%0A        public TreeNode lcaDeepestLeaves(TreeNode root) %7B%0A            return null;%0A        %7D%0A    %7D%0A%7D%0A

add skeleton for 1123