Skip to content

Selectively open sourced content from my book series, The Comprehensive Coding Interview Guide

Notifications You must be signed in to change notification settings

techRnD/Algorithms-and-LeetCode

 
 

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

17 Commits
 
 
 
 
 
 

Repository files navigation

The Comprehensive Coding Interview Guide

Partially open sourced content from my book series, The Comprehensive Coding Interview Guide. Currently two parts and will be hopefully published as two books:

  • Learning: Data Structures and Algorithms Explained with LeetCode Problems
  • Cracking: The LeetCode Problem Catalog

The book series uses Python 3 as programming language, and LeetCode Problems as examples. The advantages of doing so are obvious:

(1) Python is becoming the most popular language in the age of AI, and there are not many interview guide books using Python.

(2) Using LeetCode Problems because first they are real coding interview questions; second, with the online judge system, it is easier for learners to practice online and with the support of the community, it makes the learning process more fun.

The Purpose of The Comprehensive Coding Interview Guide

My purpose here is to offer any person who is interested with getting hands dirty with algorithms and coding a practical and strict manual to guide them through this process. The content is supposed to not only be correct (i.e. , the code and algorithms work) and catchy but also discreet (i.e , to know why it works, when it works, and how it works but not as theoretical as the Introduction to Algorithms).

Part 1: Learning: Data Structures and Algorithms Explained with LeetCode Problems

As the first part of the series, this part includes:

  1. Introduction,
  2. Fundamental Algorithm Design and Analysis (divide and conquer, complexity analysis),
  3. Data Structures (connect the doubts of data structures and Python built-in data types/Modules),
  4. Complete Search (searching on linear data structres, graph, tree),
  5. Advanced Algorithm Design (Dynamic programming, greedy algorithm),
  6. Math and Bit Manipulation

LeetCode problems as used as exercise, only id and the title of the questions are given.

Part 2: Cracking: The LeetCode Problem Catalog

The Second part of the series focusing on catagorize problems and solve them type by type.

  1. Dynamic Programming Questions (15%)
  2. Array Questions (15%)
  3. Linked List, Stack, Queue, and Heap Questions (12%)
  4. String Questions (15%)
  5. Tree Questions (10%)
  6. Graph Questions (15%)

Feedback

If you like the example chapters that I put here, please leave your comment here. This book comes with a lot of hard work --personally, I paused my PhD program for a semester to focus on. Therefore, your comment is important to lead to the publication of the work.

If you have ideas to improve the book, about formatting, more contents, or correct the errors are also very welcome too.

Possible Cooperation

If you are excellent with algorithms, or top leaders on the LeetCode Weekly contest, or made in the ACM ICPC contest, and are interested into helping and potentially coauthor on some parts of the book, please do not hesitate to contact me.

About

Selectively open sourced content from my book series, The Comprehensive Coding Interview Guide

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published