-

Author: EISAWESOME

README.md

@@ -100,3 +100,23 @@ Given the mapping `a = 1, b = 2, ... z = 26`, and an encoded message, count the
 For example, the message '111' would give 3, since it could be decoded as 'aaa', 'ka', and 'ak'.
 You can assume that the messages are decodable. For example, '001' is not allowed.
 
+[JS](pb7/answer.js) (Not timed, very long)
+
+### 8
+> This problem was asked by Google.
+
+A unival tree (which stands for "universal value") is a tree where all nodes under it have the same value.
+Given the root to a binary tree, count the number of unival subtrees.
+For example, the following tree has 5 unival subtrees:
+
+```
+   0
+  / \
+ 1   0
+    / \
+   1   0
+  / \
+ 1   1
+```
+
+[JS](pb7/answer.js) (Not timed)

pb9/Problem.md

@@ -0,0 +1,5 @@
+> This problem was asked by Airbnb.
+
+Given a list of integers, write a function that returns the largest sum of non-adjacent numbers. Numbers can be 0 or negative.
+For example, `[2, 4, 6, 2, 5]` should return `13`, since we pick 2, 6, and 5. `[5, 1, 1, 5]` should return `10`, since we pick 5 and 5.
+Follow-up: Can you do this in O(N) time and constant space?

pb9/answer.js

@@ -0,0 +1,18 @@
+const i1 = [2, 4, 6, 2, 5];
+const i2 = [5, 1, 1, 5];
+
+const nonAdjSum = (input) => {
+  const orig = [...input];
+  const nbMax = input.length % 2 ===0 ? Math.trunc(input.length / 2) : Math.trunc(input.length / 2) +1;
+  input.sort((a,b) => {
+    if(a>b)
+      return -1
+    return 1
+  })
+  
+  console.log(nbMax)
+  console.log(orig)
+  console.log(input)
+}
+
+console.log(nonAdjSum(i1));