~Get Your Files Here !

  1. Introduction

   1. Introduction.srt

  10. Substring Search Algorithms

   1. Brute-force search introduction.srt

   10. Z algorithm implementation.srt

   11. Substring search algorithms comparison.srt

   12. Applications of substring search.srt

   2. Brute-force substring search algorithm implementation.srt

   3. Rabin-Karp algorithm introduction.srt

   4. Rabin-Karp algorithm implementation.srt

   5. Knuth-Morris-Pratt algorithm introduction.srt

   6. Constructing the partial match table - visualization.srt

   7. Knuth-Morris-Pratt algorithm implementation.srt

   8. Z algorithm introduction.srt

   9. Z algorithm illustration.srt

  11. Hamiltonian Cycles - Travelling Salesman Problem

   1. What are Hamiltonian cycles.srt

   2. The travelling salesman problem.srt

   3. Travelling salesman problem implementation.srt

   4. TSP and stack memory visualization.srt

   5. Why to use meta-heuristics.srt

  12. Eulerian Cycles - Chinese Postman Problem

   1. Eulerian cycles introduction.srt

   2. Eulerian cycles applications.srt

  14. Algorhyme FREE Algorithms Visualizer App

   1. Algorithms Visualization App.srt

  2. Fenwick Trees (Binary Indexed Trees)

   1. What are Fenwick trees.srt

   2. Fenwick trees theory - tree structure.srt

   3. Fenwick trees theory - update.srt

   4. Fenwick trees implementation I.srt

   5. Fenwick trees implementation II.srt

  3. LRU Caches

   1. Why to use cache.srt

   2. LRU cache illustration.srt

   3. LRU cache implementation I.srt

   4. LRU cache implementation II.srt

   5. LRU cache implementation III.srt

  4. Splay Tree Data Structure

   1. What are splay trees.srt

   2. Splay tree introduction - example.srt

   3. Splay trees implementation I.srt

   4. Splay trees implementation II.srt

   5. Splay trees implementation III.srt

   6. Splay trees application.srt

  5. B-Trees

   1. What is external memory.srt

   2. Disk access times.srt

   3. What are B-trees.srt

   4. B-tree introduction - insertion.srt

   5. B-tree introduction - deletion.srt

   6. B-tree variants and file systems.srt

  6. Trie Data Structures (Prefix Trees)

   1. What are tries (prefix trees).srt

   10. Hashing based data structures and tries.srt

   11. Applications of trie data structures.srt

   2. Prefix tree introduction - insertion and searching.srt

   3. Prefix tree introduction - sorting.srt

   4. Prefix tree introduction - autocomplete.srt

   5. Prefix tree introduction - associative arrays.srt

   6. Tries data structure implementation I.srt

   7. Tries data structure implementation II.srt

   8. Tries data structure implementation III.srt

   9. Trie data structures as associative arrays.srt

  7. Interview Questions - IP Routing with Tries

   1. Networking and the longest common prefix problem.srt

   2. Longest common prefix implementation.srt

  8. Ternary Search Trees

   1. What are ternary search trees.srt

   2. Ternary search tree visualization.srt

   3. Ternary search tree implementation I.srt

   4. Recursion and stack memory visualization.srt

   5. Ternary search tree implementation II.srt

   6. Ternary search tree implementation III.srt

  9. Interview Questions - Boggle Game

   1. What is boggle and how to solve it.srt

   2. Boggle game with ternary search tree implementation I.srt

   3. Boggle game with ternary search tree implementation II.srt

   4. Boggle game with ternary search tree implementation III.srt

  Bonus Resources.txt