Add solution #1367

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,257 LeetCode solutions in JavaScript
+# 1,258 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1040,6 +1040,7 @@
 1363|[Largest Multiple of Three](./solutions/1363-largest-multiple-of-three.js)|Hard|
 1365|[How Many Numbers Are Smaller Than the Current Number](./solutions/1365-how-many-numbers-are-smaller-than-the-current-number.js)|Easy|
 1366|[Rank Teams by Votes](./solutions/1366-rank-teams-by-votes.js)|Medium|
+1367|[Linked List in Binary Tree](./solutions/1367-linked-list-in-binary-tree.js)|Medium|
 1368|[Minimum Cost to Make at Least One Valid Path in a Grid](./solutions/1368-minimum-cost-to-make-at-least-one-valid-path-in-a-grid.js)|Hard|
 1372|[Longest ZigZag Path in a Binary Tree](./solutions/1372-longest-zigzag-path-in-a-binary-tree.js)|Medium|
 1374|[Generate a String With Characters That Have Odd Counts](./solutions/1374-generate-a-string-with-characters-that-have-odd-counts.js)|Easy|

solutions/1367-linked-list-in-binary-tree.js

@@ -0,0 +1,45 @@
+/**
+ * 1367. Linked List in Binary Tree
+ * https://leetcode.com/problems/linked-list-in-binary-tree/
+ * Difficulty: Medium
+ *
+ * Given a binary tree root and a linked list with head as the first node.
+ *
+ * Return True if all the elements in the linked list starting from the head correspond to some
+ * downward path connected in the binary tree otherwise return False.
+ *
+ * In this context downward path means a path that starts at some node and goes downwards.
+ */
+
+/**
+ * Definition for singly-linked list.
+ * function ListNode(val, next) {
+ *     this.val = (val===undefined ? 0 : val)
+ *     this.next = (next===undefined ? null : next)
+ * }
+ */
+/**
+ * Definition for a binary tree node.
+ * function TreeNode(val, left, right) {
+ *     this.val = (val===undefined ? 0 : val)
+ *     this.left = (left===undefined ? null : left)
+ *     this.right = (right===undefined ? null : right)
+ * }
+ */
+/**
+ * @param {ListNode} head
+ * @param {TreeNode} root
+ * @return {boolean}
+ */
+var isSubPath = function(head, root) {
+  if (!head) return true;
+  if (!root) return false;
+  return checkPath(head, root) || isSubPath(head, root.left) || isSubPath(head, root.right);
+
+  function checkPath(listNode, treeNode) {
+    if (!listNode) return true;
+    if (!treeNode) return false;
+    if (listNode.val !== treeNode.val) return false;
+    return checkPath(listNode.next, treeNode.left) || checkPath(listNode.next, treeNode.right);
+  }
+};