Added 2 solutions

varunu28 · varunu28 · commit be4ebb1606d7 · 2018-09-20T16:48:20.000-07:00
diff --git a/Easy/Uncommon Words from Two Sentences.java b/Easy/Uncommon Words from Two Sentences.java
@@ -0,0 +1,19 @@
+class Solution {
+    public static String[] uncommonFromSentences(String A, String B) {
+        Map<String, Long> map = Arrays.
+                                    stream((A + " " + B).
+                                    split("\\s+")).
+                                    collect(Collectors.groupingBy(Function.identity(), Collectors.counting()));
+
+        List<String> uncommon = map.
+                                    entrySet().
+                                    stream().
+                                    filter(e -> e.getValue() == 1).
+                                    map(e -> e.getKey()).
+                                    collect(Collectors.toList());
+
+        String[] ans = new String[uncommon.size()];
+
+        return uncommon.toArray(ans);
+    }
+}
diff --git a/Medium/Insert into a Binary Search Tree.java b/Medium/Insert into a Binary Search Tree.java
@@ -0,0 +1,27 @@
+/**
+ * Definition for a binary tree node.
+ * public class TreeNode {
+ *     int val;
+ *     TreeNode left;
+ *     TreeNode right;
+ *     TreeNode(int x) { val = x; }
+ * }
+ */
+class Solution {
+    public TreeNode insertIntoBST(TreeNode root, int val) {
+        if (root == null) {
+            root = new TreeNode(val);
+            return root;
+        }
+        
+        if (root.val < val) {
+            root.right = insertIntoBST(root.right, val);
+        }
+        
+        if (root.val > val) {
+            root.left = insertIntoBST(root.left, val);
+        }
+        
+        return root;
+    }
+}
