Algorithms and Data Structures in Python (INTERVIEW Q&A)
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!
This course is about data structures, algorithms and graphs. We are going to implement the problems in Python programming language. I highly recommend typing out these data structures and algorithms several times on your own in order to get a good grasp of it. In the first part of the course we are going to learn about basic data structures such as linked lists, stacks, queues, binary search trees, heaps and some advanced ones such as AVL trees and red-black trees.. The second part will be about graph algorithms such as spanning trees, shortest path algorithms and graph traversing. We will try to optimize each data structure as much as possible.
Best Seller Course: Master the Coding Interview: Data Structures + Algorithms
What you’ll 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
You May Also Need This Course: Dynamic Programming Algorithms Master Course (2022)
