fix(book): fix table typos

book/content/part02/array-vs-list-vs-queue-vs-stack.asc

@@ -32,10 +32,10 @@ In this part of the book, we explored the most used linear data structures such
 .2+.^s| Data Structure 2+^s| Searching By 3+^s| Inserting at the 3+^s| Deleting from .2+.^s| Space
 ^|_Index/Key_ ^|_Value_ ^|_beginning_ ^|_middle_ ^|_end_ ^|_beginning_ ^|_middle_ ^|_end_
 | <> ^|O(1) ^|O(n) ^|O(n) ^|O(n) ^|O(1) ^|O(n) ^|O(n) ^|O(1) ^|O(n)
-| <> ^|O(n) ^|O(n) ^|O(1) ^|O(n) ^|O(1) ^|O(1) ^|O(n) ^|*O(n)* ^|O(n)
-| <> ^|O(n) ^|O(n) ^|O(1) ^|O(n) ^|O(1) ^|O(1) ^|O(n) ^|*O(1)* ^|O(n)
+| <> ^|O(n) ^|O(n) ^|O(1) ^|O(n) ^|*O(n)* ^|O(1) ^|O(n) ^|*O(n)* ^|O(n)
+| <> ^|O(n) ^|O(n) ^|O(1) ^|O(n) ^|*O(1)* ^|O(1) ^|O(n) ^|*O(1)* ^|O(n)
 | <> ^|- ^|- ^|- ^|- ^|O(1) ^|- ^|- ^|O(1) ^|O(n)
-| Queue (w/array) ^|- ^|- ^|- ^|- ^|*O(n)* ^|- ^|- ^|O(1) ^|O(n)
-| <> (w/list) ^|- ^|- ^|- ^|- ^|O(1) ^|- ^|- ^|O(1) ^|O(n)
+| Queue (w/array) ^|- ^|- ^|- ^|- ^|O(1) ^|*O(n)* ^|- ^|- ^|O(n)
+| <> (w/list) ^|- ^|- ^|- ^|- ^|O(1) ^|*O(1)* ^|- ^|- ^|O(n)
 |===
 // end::table[]

book/content/part04/backtracking.asc

@@ -20,7 +20,7 @@ endif::backend-pdf[]
 
 Listing all possible solutions might sound like a brute force.
 However, it is not the same.
-Backtracking algorithms are faster than brute force one.
+Backtracking algorithms are faster because it test if a path will lead to a solution or not.
 
 .Brute Force vs. Backtracking Algorithms
 ****

package.json

@@ -1,6 +1,6 @@
 {
   "name": "dsa.js",
-  "version": "1.3.8",
+  "version": "1.3.9",
   "description": "Data Structures & Algorithms in JS",
   "author": "Adrian Mejia  (https://adrianmejia.com)",
   "homepage": "https://github.com/amejiarosario/dsa.js",