@@ -90,7 +90,7 @@ Algorithm:
9090
9191[source, javascript]
9292----
93- include::interview-questions/buy-sell-stock.js[tag =description, solution]
93+ include::interview-questions/buy-sell-stock.js[tags =description; solution]
9494----
9595
9696The 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
125125
126126[source, javascript]
127127----
128- include::interview-questions/merge-lists.js[tag =description, solution]
128+ include::interview-questions/merge-lists.js[tags =description; solution]
129129----
130130
131131Notice 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
170170
171171[source, javascript]
172172----
173- include::interview-questions/linkedlist-same-data.js[tag =description, solution]
173+ include::interview-questions/linkedlist-same-data.js[tags =description; solution]
174174----
175175
176176The 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
288288
289289[source, javascript]
290290----
291- include::interview-questions/recent-counter.js[tag =description, solution]
291+ include::interview-questions/recent-counter.js[tags =description; solution]
292292----
293293
294294Notice 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
320320
321321[source, javascript]
322322----
323- include::interview-questions/design-snake-game.js[tag =description, solution]
323+ include::interview-questions/design-snake-game.js[tags =description; solution]
324324----
325325
326326As you can see, we opted for using a set to trade speed for memory.
0 commit comments