Название: Daily Coding Problem: Get Exceptionally Good at Coding Interviews by Solving One Problem Every Day, Second Edition
Автор: Lawrence Wu, Alex Miller
Издательство: Independently published
Год: 2019
Страниц: 300
Язык: английский
Формат: pdf
Размер: 10.1 MB

Daily Coding Problem contains a wide variety of questions inspired by real programming interviews, with in-depth solutions that clearly take you through each core concept. You'll learn аbout:

* Linked Lists
* Arrays
* Heaps
* Trees
* Graphs
* Randomized Algorithms
* Backtracking
* Dynamic Programming
* Stacks and Queues
* Bit Manipulation
* System Design

You may have bought this book because you are studying for an upcoming interview. Or possibly you anticipate having a coding interview in the future. Or perhaps you are simply interested in improving your knowledge of algorithms and data structures by working through a set of problems! Whatever your use case, we hope you enjoy it.

The questions in this book have been chosen with practicality, clarity, and self-improvement in mind. Each one is based on a real question that was asked recently by top tech companies. The problems and explanations were then carefully edited so that each one communicates a key idea that you can apply more generally. Finally, we have organized these problems into chapters by topic, to ensure that you can methodically build up your skills in specific areas.

At the beginning of each chapter we provide a crash course on the topic that follows, but this book is no substitute for years of coding experience or a course in computer science. As such, we assume that readers have experience with at least one programming language, and have a basic familiarity with concepts such as graphs, recursion, and hash tables.

The structure of this book is as follows. First, we introduce you to the most essential data structures that pop up in coding interviews, such as linked lists, arrays, strings, and hash tables. For each data structure, we offer a refresher on its advantages and disadvantages, the time and space complexities of its operations, its implementation, and what themes and key words to look for in order to recognize it.