
Competitive Programming in Python
128 Algorithms to Develop your Coding Skills
- English
- PDF
- Available on iOS & Android
Competitive Programming in Python
128 Algorithms to Develop your Coding Skills
About this book
Want to kill it at your job interview in the tech industry? Want to win that coding competition? Learn all the algorithmic techniques and programming skills you need from two experienced coaches, problem setters, and jurors for coding competitions. The authors highlight the versatility of each algorithm by considering a variety of problems and show how to implement algorithms in simple and efficient code. Readers can expect to master 128 algorithms in Python and discover the right way to tackle a problem and quickly implement a solution of low complexity. Classic problems like Dijkstra's shortest path algorithm and Knuth-Morris-Pratt's string matching algorithm are featured alongside lesser known data structures like Fenwick trees and Knuth's dancing links. The book provides a framework to tackle algorithmic problem solving, including: Definition, Complexity, Applications, Algorithm, Key Information, Implementation, Variants, In Practice, and Problems. Python code included in the book and on the companion website.
Frequently asked questions
- Essential is ideal for learners and professionals who enjoy exploring a wide range of subjects. Access the Essential Library with 800,000+ trusted titles and best-sellers across business, personal growth, and the humanities. Includes unlimited reading time and Standard Read Aloud voice.
- Complete: Perfect for advanced learners and researchers needing full, unrestricted access. Unlock 1.4M+ books across hundreds of subjects, including academic and specialized titles. The Complete Plan also includes advanced features like Premium Read Aloud and Research Assistant.
Please note we cannot support devices running on iOS 13 and Android 7 or earlier. Learn more about using the app.
Information
Table of contents
- Cover
- Half-title
- Title page
- Copyright information
- Contents
- Preface
- 1 Introduction
- 2 Character Strings
- 3 Sequences
- 4 Arrays
- 5 Intervals
- 6 Graphs
- 7 Cycles in Graphs
- 8 Shortest Paths
- 9 Matchings and Flows
- 10 Trees
- 11 Sets
- 12 Points and Polygons
- 13 Rectangles
- 14 Numbers and Matrices
- 15 Exhaustive Search
- 16 Conclusion
- Debugging tool
- References
- Index