This is a repository dedicated to study, learn and solve Data Structure algorithms from Grokking Algorithms books

Contemplated problems

  • Binary Tree ✔
  • Selection Sort ✔
  • Recursion
  • Quicksort
  • Hash tables
  • Breadth-first search
  • Dijkstra’s algorithm
  • Greedy algorithms
  • Dynamic programming
  • K-nearest neighbors


If you like, you can find a version of this repository written in Java here

About the book

You can find more about the book here: Grokking Algorithms


View Github