LeetCode

United States

Clean Code Handbook (Basic Edition)

** PLEASE NOTE THAT THIS CHARGE WILL SHOW AS SELZ COM PTY LTD IN YOUR CREDIT CARD STATEMENT. **

This eBook serves as the perfect companion to LeetCode Online Judge. Learn how to write clean code and apply these fundamentals in a real interview.

Revisions:

v1.0 -- Initial release

v1.0.1 (11/17) -- Fix a bug in Question 32: Binary Tree Upside Down, page 60.

TreeNode p = root, ...
should be
For the top down approach's code line no. 2: TreeNode p = null, ...

Credits to Bohong who found this mistake.

v1.0.2 (11/23) -- Revised Problem 16: "Read N Characters Given Read4 - Call multiple times" code to remove unnecessary variable sz, and also make the code slightly easier to understand.

Credits to Yuanwei who suggested this improvement.

v1.0.3 (12/18) -- Question 3 - Two Sum III, pg 8: Corrected runtime complexity for the Binary Search + Two Pointers approach, and added a new approach based on Sorting.
Question 14: One Edit Distance, pg 28: Fixed edit distance operation incorrect ordering. Credits to Zijian and Li who reported this error.

You'll get 1 PDF

  • $15.00

    $19.00
Buy this