add whole book pdf

Author: Li Yin

.DS_Store

@@ -45,6 +45,11 @@ \chapter*{Preface}
 
 Li Yin
 
+\mbox{}\\
+%\mbox{}\\
+\noindent Li Yin \\
+\noindent \url{http://liyinscience.com}
+
 8/30/2019
 
 
@@ -54,13 +59,5 @@ \chapter*{Preface}
 % Say thanks!                      %
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section*{Acknowledgements}
-\begin{itemize}
-\item A special word of thanks goes to Professor Don Knuth\footnote{\url{http://www-cs-faculty.stanford.edu/~uno/}} (for \TeX{}) and Leslie Lamport\footnote{\url{http://www.lamport.org/}} (for \LaTeX{}).
-\item I'll also like to thank Gummi\footnote{\url{http://gummi.midnightcoding.org/}} developers and LaTeXila\footnote{\url{http://projects.gnome.org/latexila/}} development team for their awesome \LaTeX{} editors.
-\item I'm deeply indebted my parents, colleagues and friends for their support and encouragement.
-\end{itemize}
-\mbox{}\\
-%\mbox{}\\
-\noindent Amber Jain \\
-\noindent \url{http://amberj.devio.us/}
+
 \end{document}

Easy-Book/chapters/preface.pdf

@@ -351,13 +351,9 @@ \part{Get Started: Programming and Python Data Structures}
 
     \includegraphics[width=0.3\columnwidth]{fig/bst_duplicate_counter.png}
 
-
-
 Python is object-oriented programming language and its underlying implementation is \texttt{C++}, which has a good mapping with the abstract data structures we discussed. Learn how to use Python data type can be learned from the official Python tutorial: \url{https://docs.python.org/3/tutorial/}. However, in order to grasp the efficiency of data structures needs us to examine its C++ source code (\url{https://github.com/python/cpython}) that relates easily to abstract data structures.
 
 
-
-
 \subfile{chapters/chapter_3_iteration_recursion}
 \label{chapter_iteration_recursion}
 
@@ -550,5 +546,5 @@ \chapter{Dynamic Programming Questions (15\%)}
 \nocite{*}
 \bibliographystyle{IEEEbib}
 {\bibliography{refer}}
-\end{document}With $l$ and $r$ to represent the left and right child of node $x$,  there are two other definitions other than the binary search tree definition we just introduced,:  (1)$l.key \leq x.key < r.key$ and (2) $l.key  < x.key \leq r.key$. In these two cases, our resulting BSTs allows us to have duplicates. 
+\end{document}
 

Easy-Book/chapters/preface.synctex.gz

@@ -1,7 +1,7 @@
 # **Hands-on Algorithmic Problem Solving** [![Awesome](https://cdn.rawgit.com/sindresorhus/awesome/d7305f38d29fed78fa85652e3a63e154dd8e8829/media/badge.svg)](https://github.com/sindresorhus/awesome)
 
 ## Contributing
-The book is written in latex, and all contents except the code is located under [**Easy-Book** folder](Easy-Book). Feel free to send me  [pull requests](https://github.com/liyin2015/python-coding-interview/pulls) or email (li.yin.gravity@gmail.com) to contribute contents. Before you start to improve the contents, it would be helpful to know the [high-level of the structure of the book](#about-this-book).
+The book is written in latex, and all contents except the code is located under [**Easy-Book** folder](Easy-Book). Feel free to send me  [pull requests](https://github.com/liyin2015/python-coding-interview/pulls) or email (li.yin.gravity@gmail.com) to contribute contents. Before you start to improve the contents, it would be helpful to know the [high-level structure of the book](#about-this-book).
 
 
 ## A one-stop coding interview prep book!