.MP4 | Video: h264, 1280×720 | Audio: AAC, 44.1 KHz, 2 ChGenre: eLearning | Language: English + .VTT | Duration: 3 hours | Size: 929 MBFenwick trees, caches, prefix trees and substring-search algorithms implemented in PythonWhat you’ll learnHave a good grasp of algorithmic thinkingBe able to develop your own algorithmsBe able to detect and correct inefficient code snippetsRequirementsPython basicsSome theoretical background ( big O notation )DescriptionThis course is for those who are interested in computer science and want to implement the algorithms and given data structures in Python.

In every chapter you will learn about the theory of a given data structure or algorithm and then you will implement them from scratch.

Chapter 1: Binary Indexed Trees (Fenwick Trees)theory behind the binary indexed tree or Fenwick tree data structurehow to use this data structure in computer vision and artificial intelligenceimplementation in PythonChapter 2: LRU Cacheswhat are caches and why are they so importanttheory behind LRU cachesimplementation in PythonChapter 3: Prefix Trees (Tries)what are tries or prefix treesreal world applications of triesimplementation in PythonChapter 4: Substring Search Algorithmswhat are substring search algorithms and why are they important in real world softwaresbrute-force substring search algorithmBoyer-Moore algortihmKnuth-Morris-Pratt substring search algorithmimplementation in PythonThanks for joining my course, let’s get started!Who is the target audience?This course is suited for anyone who has some basic knowledge in Python