feat(book): add appendix D with interview question solutions

Author: amejiarosario

book/D-interview-questions-solutions.asc

@@ -13,7 +13,10 @@ We are asked to rotate an array multiple times (`k`).
 
 One brute force solution, would be removing the first element and appending it to the end `k` times:
 
+[source, javascript]
+----
 include::interview-questions/rotate-array-left.js[tag=bruteForce]
+----
 
 However, what would happen if the array is huge (millions of elements)?
 How efficient will be if `k` number is large (thousands)?
@@ -22,8 +25,11 @@ When k is bigger than the array, it will loop back over and over again. We can a
 
 Here's the final solution:
 
+[source, javascript]
+----
 include::interview-questions/rotate-array-left.js[tag=description]
 include::interview-questions/rotate-array-left.js[tag=solution]
+----
 
 It runs on `O(n^2)` while the brute force solution was doing `O(n^2 * k)`.
 

book/readme.asc

@@ -60,6 +60,8 @@ include::B-self-balancing-binary-search-trees.asc[]
 
 include::C-AVL-tree.asc[]
 
+include::D-interview-questions-solutions.asc[]
+
 include::index.asc[]
 
 // ifndef::ebook-format[include::index.asc[]]