fix(book/solutions): fix missing solutions

Author: amejiarosario

book/D-interview-questions-solutions.asc

@@ -90,7 +90,7 @@ Algorithm:
 
 [source, javascript]
 ----
-include::interview-questions/buy-sell-stock.js[tag=description,solution]
+include::interview-questions/buy-sell-stock.js[tags=description;solution]
 ----
 
 The runtime is `O(n)` and the space complexity of `O(1)`.
@@ -125,7 +125,7 @@ Another case to take into consideration is that lists might have different lengt
 
 [source, javascript]
 ----
-include::interview-questions/merge-lists.js[tag=description,solution]
+include::interview-questions/merge-lists.js[tags=description;solution]
 ----
 
 Notice that we used a "dummy" node or "sentinel node" to have some starting point for the final list.
@@ -170,7 +170,7 @@ A better way to solve this problem is iterating over each character on both list
 
 [source, javascript]
 ----
-include::interview-questions/linkedlist-same-data.js[tag=description,solution]
+include::interview-questions/linkedlist-same-data.js[tags=description;solution]
 ----
 
 The function `findNextPointerIndex` is a helper to navigate each character on a linked list.
@@ -288,7 +288,7 @@ We are asked to keep track of the request's count only within a given time windo
 
 [source, javascript]
 ----
-include::interview-questions/recent-counter.js[tag=description,solution]
+include::interview-questions/recent-counter.js[tags=description;solution]
 ----
 
 Notice that we enqueue every request, and then we check all the ones that have "expire" and remove them from the queue.
@@ -320,7 +320,7 @@ This game is perfect to practice working with Queues. There are at least two opp
 
 [source, javascript]
 ----
-include::interview-questions/design-snake-game.js[tag=description,solution]
+include::interview-questions/design-snake-game.js[tags=description;solution]
 ----
 
 As you can see, we opted for using a set to trade speed for memory.