Algorithms: For Competitive Programming

by David Esparza Alba

What is new?We fixed grammatical issues and added more detailed explanations for the algorithms and exercises. What is this book about?Are you preparing for your incoming programming contest or coding interview? This book contains detailed explanations and source code for algorithms used in competitive programming, written by software engineers with experience in programming competitions and developing highly scalable systems for some of the biggest tech companies. It covers Graph Theory, Number Theory, Combinatorics, Dynamic Programming, Geometry, and more algorithms. Competitive programming is frequently associated with algorithms, but an algorithm is just a set of instructions given to the computer to solve a specific problem already in the head of the programmer. This book aims to provide two things for each a brief description of how it works and a source code that implements the theory behind the algorithm. Each section contains exercises and their respective solutions. Also, the appendices contain problems with non-trivial solutions that we have selected to show the reader how sometimes simple algorithms can solve complex problems and also how simple problems may require a complex solution. You can find the source code of the exercises and other algorithms in this book on the GitHub We have written this book because of our passion for algorithms; its content comes from training for programming competitions, coaching and mentoring others, failures and successes in interviews, and our tech industry experience. We hope that you find this valuable book for your objectives and that you enjoy reading it as much as we enjoyed writing it.

Kindle Edition

Published January 25, 2021