Data Structures for Coding Interviews in Python

Description

In this course, you will learn :

• Data structures are one of the most basic concepts in computer science. A computer program's data structure can make or break it.
• Detailed review of all common data structures as well as implementation level details in Python, allowing them to become well-equipped.
• More code solutions, lessons, and illustrations than ever before!

Syllabus :

1. Introduction to Complexity Measures

• Comparing Algorithms
• Introduction to Asymptotic Analysis and Big O
• Other Common Asymptotic Notations and Why Big O Trumps Them
• Useful Formulas
• Common Complexity Scenarios

 

2. Introduction to Lists

• Lists
• Arrays
• Lists vs Arrays in Python

 

3. Introduction to Linked Lists

• Singly Linked Lists (SLL)
• Linked Lists vs. Lists
• Basic Linked List Operations
• Singly Linked List Insertion

 

4. Introduction to Stacks and Queues

• What is a Stack?
• Stack (Implementation)
• What is a Queue?
• Queue (Implementation)

 

5. Introduction to Graphs

• What is a Graph?
• Types of Graphs
• Representation of Graphs
• Graph Implementation
• Complexities of Graph Operations
• What is a Bipartite Graph?
• Graph Traversal Algorithms

 

6. Introduction to Trees

• Trees and their Basic Properties!
• What makes a tree 'balanced'?
• What is a Binary Tree?
• More on Complete Binary Trees
• Skewed Binary Trees
• What is a Binary Search Tree (BST)?
• Implementing a Binary Search Tree in Python
• Binary Search Tree Insertion
• Binary Search Tree Insertion (Implementation)
• Searching in a Binary Search Tree (Implementation)
• Deletion in a Binary Search Tree
• Deletion in a Binary Search Tree (Implementation)
• Pre-Order Traversal
• Post-Order Traversal
• In-Order Traversal
• What is an AVL Tree?
• AVL Insertion
• AVL Deletion
• What is a Red-Black Tree?
• Red-Black Tree Insertion
• Red-Black Tree Deletion
• What is a 2-3 Tree?
• Insertion
• Deletion
• Trees
• Overview of Trees

 

7. Trie

• What is a Trie?
• Structure of a Trie
• Insertion in a Trie
• Search in a Trie
• Deletion in Trie

 

8. Introduction to Heap

• What is a Heap?
• Max Heap: Introduction
• Max Heap (Implementation)
• Min Heap: Introduction
• Min Heap (Implementation)

 

9. Introduction to Hashing

• What is a Hash Table?
• The Hash Function
• Collisions in Hash Tables
• Building a Hash Table from Scratch
• Add/Remove & Search in Hash Table (Implementation)
• A Quick Overview of Hash Tables
• Trees vs Hash Table
• Dictionary vs Set

Show more