p115

Author: ashwanikumar04

AllQuestions.md

@@ -1844,7 +1844,7 @@ maintaining the relative order of the delimiters. For example, given
 Follow-up: Does your solution work for the following cases: "hello/world:here/",
 "hello//world:here"
 
-## Problem-115:waxing_crescent_moon:
+## [Problem-115](src/main/java/in/ashwanik/dcp/problems/p91_120/p115):sunny:
 
 
 > This problem was asked by Google.

README.md

@@ -3,12 +3,12 @@ Solutions to the coding problems from [Daily coding problem](https://dailycoding
 
 ## For all questions, see [here](AllQuestions.md)
 
-## **Google (36)**
+## **Google (37)**
 | | | | | | | | | | | | | | | |
 |--|--|--|--|--|--|--|--|--|--|--|--|--|--|--|
 |[P1](src/main/java/in/ashwanik/dcp/problems/p1_30/p1)|[P3](src/main/java/in/ashwanik/dcp/problems/p1_30/p3)|[P8](src/main/java/in/ashwanik/dcp/problems/p1_30/p8)|[P14](src/main/java/in/ashwanik/dcp/problems/p1_30/p14)|[P17](src/main/java/in/ashwanik/dcp/problems/p1_30/p17)|[P18](src/main/java/in/ashwanik/dcp/problems/p1_30/p18)|[P20](src/main/java/in/ashwanik/dcp/problems/p1_30/p20)|[P23](src/main/java/in/ashwanik/dcp/problems/p1_30/p23)|[P24](src/main/java/in/ashwanik/dcp/problems/p1_30/p24)|[P26](src/main/java/in/ashwanik/dcp/problems/p1_30/p26)|[P31](src/main/java/in/ashwanik/dcp/problems/p31_60/p31)|[P35](src/main/java/in/ashwanik/dcp/problems/p31_60/p35)|[P37](src/main/java/in/ashwanik/dcp/problems/p31_60/p37)|[P42](src/main/java/in/ashwanik/dcp/problems/p31_60/p42)|[P44](src/main/java/in/ashwanik/dcp/problems/p31_60/p44)|
 |[P48](src/main/java/in/ashwanik/dcp/problems/p31_60/p48)|[P52](src/main/java/in/ashwanik/dcp/problems/p31_60/p52)|[P56](src/main/java/in/ashwanik/dcp/problems/p31_60/p56)|[P61](src/main/java/in/ashwanik/dcp/problems/p61_90/p61)|[P64](src/main/java/in/ashwanik/dcp/problems/p61_90/p64)|[P67](src/main/java/in/ashwanik/dcp/problems/p61_90/p67)|[P68](src/main/java/in/ashwanik/dcp/problems/p61_90/p68)|[P72](src/main/java/in/ashwanik/dcp/problems/p61_90/p72)|[P73](src/main/java/in/ashwanik/dcp/problems/p61_90/p73)|[P76](src/main/java/in/ashwanik/dcp/problems/p61_90/p76)|[P78](src/main/java/in/ashwanik/dcp/problems/p61_90/p78)|[P80](src/main/java/in/ashwanik/dcp/problems/p61_90/p80)|[P83](src/main/java/in/ashwanik/dcp/problems/p61_90/p83)|[P86](src/main/java/in/ashwanik/dcp/problems/p61_90/p86)|[P90](src/main/java/in/ashwanik/dcp/problems/p61_90/p90)|
-|[P94](src/main/java/in/ashwanik/dcp/problems/p91_120/p94)|[P100](src/main/java/in/ashwanik/dcp/problems/p91_120/p100)|[P104](src/main/java/in/ashwanik/dcp/problems/p91_120/p104)|[P108](src/main/java/in/ashwanik/dcp/problems/p91_120/p108)|[P111](src/main/java/in/ashwanik/dcp/problems/p91_120/p111)|[P113](src/main/java/in/ashwanik/dcp/problems/p91_120/p113)|
+|[P94](src/main/java/in/ashwanik/dcp/problems/p91_120/p94)|[P100](src/main/java/in/ashwanik/dcp/problems/p91_120/p100)|[P104](src/main/java/in/ashwanik/dcp/problems/p91_120/p104)|[P108](src/main/java/in/ashwanik/dcp/problems/p91_120/p108)|[P111](src/main/java/in/ashwanik/dcp/problems/p91_120/p111)|[P113](src/main/java/in/ashwanik/dcp/problems/p91_120/p113)|[P115](src/main/java/in/ashwanik/dcp/problems/p91_120/p115)|
 
 
 ## **Facebook (16)**

src/main/java/in/ashwanik/dcp/problems/p91_120/p115/Readme.md

@@ -0,0 +1,4 @@
+Given two non-empty binary trees s and t, check whether tree t has exactly the
+same structure and node values with a subtree of s. A subtree of s is a tree
+consists of a node in s and all of this node's descendants. The tree s could
+also be considered as a subtree of itself.

src/main/java/in/ashwanik/dcp/problems/p91_120/p115/Solution.java

@@ -0,0 +1,60 @@
+package in.ashwanik.dcp.problems.p91_120.p115;
+
+import in.ashwanik.dcp.common.TreeNode;
+
+import java.util.ArrayList;
+import java.util.List;
+
+class Solution {
+
+    boolean isSubTree(TreeNode<Integer> S, TreeNode<Integer> T) {
+        if (S == null) {
+            return false;
+        }
+
+        List<String> s = new ArrayList<>();
+        List<String> t = new ArrayList<>();
+
+        inorder(S, s);
+        inorder(T, t);
+
+        String sStr = String.join(",", s);
+        String tStr = String.join(",", t);
+        if (!sStr.contains(tStr)) {
+            return false;
+        }
+
+        s.clear();
+        t.clear();
+
+        preorder(S, s);
+        preorder(T, t);
+
+        sStr = String.join(",", s);
+        tStr = String.join(",", t);
+        return sStr.contains(tStr);
+    }
+
+
+    private void inorder(TreeNode<Integer> root, List<String> items) {
+        if (root == null) {
+            items.add("$");
+            return;
+        }
+        inorder(root.getLeft(), items);
+        items.add(root.getData().toString());
+        inorder(root.getRight(), items);
+    }
+
+
+    private void preorder(TreeNode<Integer> root, List<String> items) {
+        if (root == null) {
+            items.add("$");
+            return;
+        }
+        items.add(root.getData().toString());
+        preorder(root.getLeft(), items);
+        preorder(root.getRight(), items);
+    }
+
+}

src/test/java/in/ashwanik/dcp/problems/p91_120/p115/SolutionTest.java

@@ -0,0 +1,19 @@
+package in.ashwanik.dcp.problems.p91_120.p115;
+
+import in.ashwanik.dcp.common.TreeNode;
+import org.junit.jupiter.api.Test;
+
+import static org.junit.jupiter.api.Assertions.assertTrue;
+
+public class SolutionTest {
+    @Test
+    void testIsSubTree() {
+        TreeNode<Integer> root = new TreeNode<>(1,
+                new TreeNode<>(2),
+                new TreeNode<>(3,
+                        new TreeNode<>(4),
+                        new TreeNode<>(5)));
+
+        assertTrue(new Solution().isSubTree(root, root.getRight()));
+    }
+}