Algorithms and Data Structures

Short lessons on algorithms and data structures. Each lesson is given inside a self-contained notebook, containing both theory and code.

How to contribute

Name		Name	Last commit message	Last commit date
Latest commit History 6 Commits
Bonus.ipynb		Bonus.ipynb
Lesson 01 - Linked Lists.ipynb		Lesson 01 - Linked Lists.ipynb
Lesson 02 - Binary Trees.ipynb		Lesson 02 - Binary Trees.ipynb
Lesson 03 - Sorting.ipynb		Lesson 03 - Sorting.ipynb
Lesson 04 - Dynamic Programming.ipynb		Lesson 04 - Dynamic Programming.ipynb
Lesson 05 - Graphs.ipynb		Lesson 05 - Graphs.ipynb
Lesson 06 - Heaps.ipynb		Lesson 06 - Heaps.ipynb
Lesson 07 - Greedy algorithms.ipynb		Lesson 07 - Greedy algorithms.ipynb
Lesson 08 - Bit Operation.ipynb		Lesson 08 - Bit Operation.ipynb
Lesson 09 - Divide and Conquer.ipynb		Lesson 09 - Divide and Conquer.ipynb
Lesson 10 - Backtracking.ipynb		Lesson 10 - Backtracking.ipynb
Lesson 11 - Sliding windows.ipynb		Lesson 11 - Sliding windows.ipynb
Lesson 12 - Sparse geometry.ipynb		Lesson 12 - Sparse geometry.ipynb
README.md		README.md