epub validation passed!!!

Author: amejiarosario

book-pro/A-time-complexity-cheatsheet.asc

@@ -12,8 +12,6 @@ include::content/part01/algorithms-analysis.asc[tag=table]
 
 === Linear Data Structures
 
-// <<part02-linear-data-structures#linear-data-structures-table>>
-
 include::content/part02/array-vs-list-vs-queue-vs-stack.asc[tag=table]
 
 === Trees and Maps Data Structures

book-pro/Find-the-largest-sum.png

@@ -26,11 +26,11 @@ namespace :book do
       # require_pdf = ''
 
 
-      puts "\r\n>> Converting to HTML..."
-      cmd = "asciidoctor #{require} #{params} #{input} 2>&1"
-      puts cmd
-      puts `#{cmd}`
-      puts "\t-- HTML output at progit.html"
+      # puts "\r\n>> Converting to HTML..."
+      # cmd = "asciidoctor #{require} #{params} #{input} 2>&1"
+      # puts cmd
+      # puts `#{cmd}`
+      # puts "\t-- HTML output at progit.html"
 
       # puts "\r\nConverting to PDF... (this one takes a while)"
       # cmd = "bundle exec asciidoctor-pdf #{require} #{require_pdf} #{params} #{input} 2>&1"
@@ -39,16 +39,18 @@ namespace :book do
       # puts " -- PDF output at progit.pdf"
 
       puts "\r\n>> Converting to EPub..."
-      # cmd = "bundle exec asciidoctor-epub3 #{require} -a ebook-validate #{params} #{input} 2>&1"
-      cmd = "bundle exec asciidoctor-epub3 #{require} #{params} #{input} 2>&1"
+      cmd = "bundle exec asciidoctor-epub3 #{require} -a ebook-validate #{params} #{input} 2>&1"
+      # cmd = "bundle exec asciidoctor-epub3 #{require} #{params} #{input} 2>&1"
       puts cmd
       puts `#{cmd}`
       puts "\t-- Epub output at progit.epub"
 
       # puts "\r\nConverting to Mobi (kf8)..."
+      # cmd = "bundle exec asciidoctor-epub3 #{require} #{params} #{input} 2>&1"
+      # puts cmd
+      # puts `#{cmd}`
       # puts `bundle exec asciidoctor-epub3 #{params} -a ebook-format=kf8 #{input} 2>&1`
       # puts " -- Mobi output at progit.mobi"
-
     end
   end
 end

book-pro/Find-the-largest-sum.svg

@@ -114,6 +114,7 @@ If there’s no match, we return `undefined` then. The runtime is _O(n)_. As you
 
 Similar to the array, with a linked list you can add elements at the beginning, end or anywhere in the middle of the list. So, let's implement each case.
 
+[[linked-list-inserting-beginning]]
 ===== Inserting elements at the beginning of the list
 
 We are going to use the `Node` class to create a new element and stick it at the beginning of the list as shown below.
@@ -124,8 +125,6 @@ image:images/image23.png[image,width=498,height=217]
 
 To insert at the beginning, we create a new node with the next reference to the current first node. Then we make first the new node. In code, it would look something like this:
 
-[[linked-list-inserting-beginning]]
-
 .Add item to the beginning of a Linked List
 [source, javascript]
 ----

book-pro/Recursive-Fibonacci-call-tree-with-dp.png

@@ -75,7 +75,7 @@ As you can see, we iterate through each element and swap with the following lett
 
 In the following tree, you can visualize how the backtracking algorithm is swapping the letters. We are taking the `art` as an example.
 
-[graphviz, Words Permutations, svg]
+[graphviz, Words-Permutations, png]
 ....
 digraph g {
   node [shape = record,height=.1];

book-pro/Recursive-Fibonacci-call-tree-with-dp.svg

@@ -49,7 +49,7 @@ The implementation above does the job, but what's the runtime?
 For that, let's take a look at the job performed calculating the `fib(5)` number. Since `fib(5) = fib(4) + fib(3)`, we need to find the answer for `fib(4)` and `fib(3)`. We do that recursively until we reach the base cases of `fib(1)` and `fib(0)`. If we represent the calls in a tree, we would have the following:
 
 // http://bit.ly/2UmwzZV
-[graphviz, Recursive Fibonacci call tree, png]
+[graphviz, recursive-fibonacci-call-tree, png]
 ....
 graph G {
     "fib(5)" -- { "fib(4)", "fib(3)" }

book-pro/Words-Permutations.png

@@ -40,7 +40,7 @@ include::{codedir}/algorithms/fibanacci-dynamic-programming.js[tag=snippet,inden
 
 This implementation checks if we already calculated the value, if so it will save it for later use.
 
-[graphviz, Recursive Fibonacci call tree with dp, svg]
+[graphviz, Recursive-Fibonacci-call-tree-with-dp, png]
 ....
 graph G {
     "fib(5)" -- { "fib(4)" }

book-pro/Words-Permutations.svg

@@ -7,7 +7,7 @@ They are quick but not always lead to most optimum results since it might not ta
 
 An excellent example of a greedy algorithm that doesn't work well is finding the largest sum on a tree.
 
-[graphviz, Find the largest sum, svg]
+[graphviz, Find-the-largest-sum, png]
 ....
 graph G {
   5 -- 3 [color="#B8E986", penwidth=2]

book-pro/config/Rakefile

@@ -17,7 +17,7 @@ include::{codedir}/algorithms/fibanacci-dynamic-programming.js[tag=snippet,inden
 
 This implementation checks if we already calculated the value, if so it will save it for later use.
 
-[graphviz, Recursive Fibonacci call tree with dp, svg]
+[graphviz, Recursive Fibonacci call tree with dp, png]
 ....
 graph G {
     "fib(5)" -- { "fib(4)" }