Algorithms and Data Structures in Python (INTERVIEW Q&A)

A guide to implement data structures, graph algorithms and sorting algorithms from scratch with interview questions!

Created by: Holczer Balazs
Software Engineer

What Will I Learn?

• Understand arrays and linked lists
• Understand stacks and queues
• Understand tree like data structures (binary search trees)
• Understand balances trees (AVL trees and red-black trees)
• Understand heap data structures
• Understand hashing, hash tables and dictionaries
• Understand the differences between data structures and abstract data types
• Understand graph traversing (BFS and DFS)
• Understand shortest path algorithms such as Dijkstra's approach or Bellman-Ford method
• Understand minimum spanning trees (Prims's algorithm)
• Understand sorting algorithms
• Be able to develop your own algorithms
• Have a good grasp of algorithmic thinking
• Be able to detect and correct inefficient code snippets

Requirements

• Python basics
• Some theoretical background ( big O notation )

Target audience

• Beginner Python developers curious about graphs, algorithms and data structures