**

Author: EISAWESOME

README.md

@@ -100,6 +100,9 @@ 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.
 
+
+## Solution
+
 [JS](pb7/answer.js) (Not timed, very long)
 
 ### 8
@@ -119,4 +122,6 @@ For example, the following tree has 5 unival subtrees:
  1   1
 ```
 
+## Solution
+
 [JS](pb8/answer.js) (Not timed)