liyin2015 / python-coding-interview Goto Github PK

Hey Li yin,
Unable to find the complete book in the repository, previously I have seen the full book. Is it removed intentionally or by chance ?

Thank you for the hard work.

I have trouble understanding the "all paths" example in the backtracking chapter.

Unlike the in the permutations and combinations example, the arguments in this function is undocumented, and why the graph can be represented in the array is not explained.

Hey I first want to say this book you put together looks like its going to be super useful and helpful and I want to thank you for your hard work creating it. When I click on the link to download the whole book as a pdf I am getting an error saying "unable to render rich display Invalid PDF". I am not sure why this error is occurring but I thought I would let you know. Here is a screenshot of the error.
thanks again

Section 0.1.1 - Example 2: Node 3 is supposed to be the mid Node.

Decrease and Conquer - Binary Search
• If it is smaller than the target, move to the left half by setting the right
pointer to the position right before the middle position, r = m − 1.
• If it is larger than the target, move to the right half by setting the left
pointer to the position right after the middle position, l = m + 1.

Any plans to add Trees, Graphs in the datastructures.ipynb? Could you give timeline? Are you open to PR's?

Keep up the good work! I couldn't find any comparable resource anywhere like this book. Despite it is still under development and some parts are missing, it is very well organized and have common pattern and tricks to solve all question types.