Competitive Programming in Python

This book has very good collection of problems that are worth solving either for competitive programming or interviews. However, the explanations are very terse and hard to understand. I mostly ended up googling the problems to get an online resource to understand the solution approaches. Also, the book is quite expensive.

Good read

For example, on page 120 when explaining Ahujas algorithm, it incorrectly says "the objective value of C is at least delta" rather than at most. The inequality itself showed literally contradicts what it says. It also lacks a bit in time complexity analysis, for example, not explaining the worst case of Karps algorithm, nor even mentioning iterating over edges and using endpoints rather than directly iterating over vertices and their adjacent vertices to consider edges. It also considers worst case hashing instead of amortization, and sometimes does not elaborate on different statements (no corollaries or examples). Also some missing footnotes, for example, the number 8 in the Flows section, literally has no corresponding footnote. On page 194, it says LCD of x and y instead of GCD (regarding two integers which literally would always have an LCD of 1.) On page 189, the brackets are ordered wrong and lead to an incorrect implementation. These are the flaws so far. However, it is still a really solid book which goes over a wide range of different algorithms, and I have picked up new things. It just could be much better if, when I verified those new things, parts of the text were more accurate and actually type checked. I still recommend this for anyone who loves algorithms, but it could be improved, hopefully in further versions.

There seems something missing at the end of 3.5. For example, it does not end with a Problem section as every other section does. Moreover, the notation P[i] is not explained. BTW, mine is kindle book.