The motivation for writing this book was the lack of resources available about data
today many of the job opportunities for software development require knowledge of
developers to understand how data structures work and how to design algorithms to
Therefore, this book aims to teach data structure and algorithm concepts from
The classical inheritance pattern allows inheritance by creating a blueprint-like
that objects follow during inheritance. However, the prototypal inheritance pattern
means copying the objects and changing their properties.
This book first covers fundamental mathematics for Big-O analysis and then lays out
covers implementations and algorithms for fundamental data structures such as linked
lists, stacks, trees, heaps, and graphs. Finally, more advanced topics such as efficient
string search algorithms, caching algorithms, and dynamic programming problems are
explored in great detail.
You'll discover how to implement data structures such as hash tables, linked lists, stacks, queues, trees, and graphs. You'll also learn how a URL shortener, such as bit.ly, is developed and what is happening to the data as a PDF is uploaded to a webpage. This book covers the practical applications of data structures and algorithms to encryption, searching, sorting, and pattern matching.
What You'll Learn
Review core data structure fundamentals: arrays, linked-lists, trees, heaps, graphs, and hash-table
Review core algorithm fundamentals: search, sort, recursion, breadth/depth first search, dynamic programming, bitwise operators
Who This Book Is For