36,20 €*
Versandkostenfrei per Post / DHL
auf Lager, Lieferzeit 1-2 Werktage
Are you hitting a wall with data structures and algorithms? Whether you’re a student prepping for coding interviews or an independent learner, this book is your essential guide to efficient problem-solving in programming.
UNLOCK THE POWER OF DATA STRUCTURES & ALGORITHMS:
Learn the intricacies of hash tables, recursion, dynamic programming, trees, graphs, and heaps. Become proficient in choosing and implementing the best solutions for any coding challenge.
REAL-WORLD, COMPETITION-PROVEN CODE EXAMPLES:
The programs and challenges in this book aren’t just theoretical—they’re drawn from real programming competitions. Train with problems that have tested and honed the skills of coders around the world.
GET INTERVIEW-READY:
Prepare yourself for coding interviews with practice exercises that help you think algorithmically, weigh different solutions, and implement the best choices efficiently.
WRITTEN IN C, USEFUL ACROSS LANGUAGES:
The code examples are written in C and designed for clarity and accessibility to those familiar with languages like C++, Java, or Python. If you need help with the C code, no problem: We’ve got recommended reading, too.
Algorithmic Thinking is the complete package, providing the solid foundation you need to elevate your coding skills to the next level.
Are you hitting a wall with data structures and algorithms? Whether you’re a student prepping for coding interviews or an independent learner, this book is your essential guide to efficient problem-solving in programming.
UNLOCK THE POWER OF DATA STRUCTURES & ALGORITHMS:
Learn the intricacies of hash tables, recursion, dynamic programming, trees, graphs, and heaps. Become proficient in choosing and implementing the best solutions for any coding challenge.
REAL-WORLD, COMPETITION-PROVEN CODE EXAMPLES:
The programs and challenges in this book aren’t just theoretical—they’re drawn from real programming competitions. Train with problems that have tested and honed the skills of coders around the world.
GET INTERVIEW-READY:
Prepare yourself for coding interviews with practice exercises that help you think algorithmically, weigh different solutions, and implement the best choices efficiently.
WRITTEN IN C, USEFUL ACROSS LANGUAGES:
The code examples are written in C and designed for clarity and accessibility to those familiar with languages like C++, Java, or Python. If you need help with the C code, no problem: We’ve got recommended reading, too.
Algorithmic Thinking is the complete package, providing the solid foundation you need to elevate your coding skills to the next level.
Introduction
Acknowledgments
Chapter 1: Hash Tables
Chapter 2: Trees and Recursion
Chapter 3: Memoization and Dynamic Programming
Chapter 4: Advanced Memoization and Dynamic Programming
Chapter 5: Graphs and Breadth-First Search
Chapter 6: Shortest Paths in Weighted Graphs
Chapter 7: Binary Search
Chapter 8: Heaps and Segment Trees
Chapter 9: Union-Find
Chapter 10: Randomization
Afterword
Appendix A: Algorithm Runtime
Appendix B: Because I Can’t Resist
Appendix C: Problem Credits
Index
| Erscheinungsjahr: | 2024 |
|---|---|
| Genre: | Informatik |
| Rubrik: | Naturwissenschaften & Technik |
| Medium: | Taschenbuch |
| Seiten: | 438 |
| Inhalt: | Einband - flex.(Paperback) |
| ISBN-13: | 9781718503229 |
| ISBN-10: | 1718503229 |
| Sprache: | Englisch |
| Einband: | Kartoniert / Broschiert |
| Autor: | Zingaro, Daniel |
| Auflage: | 2nd Edition |
| Hersteller: |
Random House LLC US
No Starch Press |
| Maße: | 236 x 178 x 29 mm |
| Von/Mit: | Daniel Zingaro |
| Erscheinungsdatum: | 23.01.2024 |
| Gewicht: | 0,898 kg |
Introduction
Acknowledgments
Chapter 1: Hash Tables
Chapter 2: Trees and Recursion
Chapter 3: Memoization and Dynamic Programming
Chapter 4: Advanced Memoization and Dynamic Programming
Chapter 5: Graphs and Breadth-First Search
Chapter 6: Shortest Paths in Weighted Graphs
Chapter 7: Binary Search
Chapter 8: Heaps and Segment Trees
Chapter 9: Union-Find
Chapter 10: Randomization
Afterword
Appendix A: Algorithm Runtime
Appendix B: Because I Can’t Resist
Appendix C: Problem Credits
Index
| Erscheinungsjahr: | 2024 |
|---|---|
| Genre: | Informatik |
| Rubrik: | Naturwissenschaften & Technik |
| Medium: | Taschenbuch |
| Seiten: | 438 |
| Inhalt: | Einband - flex.(Paperback) |
| ISBN-13: | 9781718503229 |
| ISBN-10: | 1718503229 |
| Sprache: | Englisch |
| Einband: | Kartoniert / Broschiert |
| Autor: | Zingaro, Daniel |
| Auflage: | 2nd Edition |
| Hersteller: |
Random House LLC US
No Starch Press |
| Maße: | 236 x 178 x 29 mm |
| Von/Mit: | Daniel Zingaro |
| Erscheinungsdatum: | 23.01.2024 |
| Gewicht: | 0,898 kg |
Ähnliche Produkte
Lieferzeit 1-2 Wochen
Lieferzeit 1-2 Werktage
Lieferzeit 1-2 Wochen
Lieferzeit 1-2 Wochen
Lieferzeit 1-2 Wochen
Lieferzeit 4-7 Werktage
Lieferzeit 1-2 Wochen
Lieferzeit 1-2 Werktage
