Back To Course Home

Data Structures for Coding Interviews in Python

0% completed

Introduction to Complexity Measures

Comparing Algorithms Example: Measuring Time Complexity of For Loop Example: Measuring Time Complexity of a Nested For Loop Introduction to Asymptotic Analysis and Big O Other Common Asymptotic Notations and Why Big O Trumps Them Useful Formulas Common Complexity Scenarios Challenge: Big O of Nested Loop with Addition Solution: Big O of Nested Loop with Addition Challenge: Big O of Nested Loop with Subtraction Solution: Big O of Nested Loop with Subtraction Challenge: Big O of Nested Loop with Multiplication Solution: Big O of Nested Loop with Multiplication Challenge: Nested Loop with Multiplication (Basic)Solution: Nested Loop with Multiplication (Basic)Challenge: Nested Loop with Multiplication (Intermediate)Solution: Nested Loop with Multiplication (Intermediate)Challenge: Nested Loop with Multiplication (Advanced)Solution: Nested Loop with Multiplication (Advanced)Challenge: Nested Loop with Multiplication (Pro)Solution: Nested Loop with Multiplication (Pro)Complexity Quiz: Test your understanding of complexity

Introduction to Lists

Lists Arrays Lists vs Arrays in Python Challenge: Remove Even Integers from List Solution: Remove Even Integers from a List Challenge: Merge Two Sorted Lists Solution: Merge Two Sorted Lists Challenge: Find Two Numbers that Add up to "k"Solution: Find Two Numbers that Add up to "k"Challenge: List of Products of all Elements Solution: List of Products of All Elements Challenge: Find Minimum Value in List Solution: Find Minimum Value in List Challenge: First Non-Repeating Integer in a List Solution: First Non-Repeating Integer in a List Challenge: Find Second Maximum Value in a List Solution: Find Second Maximum Value in a List Challenge: Right Rotate List Solution: Right Rotate List Challenge: Rearrange Positive & Negative Values Solution: Rearrange Positive & Negative Values Challenge: Rearrange Sorted List in Max/Min Form Solution: Rearrange Sorted List in Max/Min Form Challenge: Maximum Sum Sublist Solution: Maximum Sum Sublist Lists Quiz: Test your understanding of Lists

Introduction to Linked Lists

Singly Linked Lists (SLL)Linked Lists vs. Lists Basic Linked List Operations Singly Linked List Insertion Challenge: Insertion at Tail Solution: Insertion at Tail Challenge: Search in a Singly Linked List Solution: Search in a Singly Linked List Singly Linked List Deletion Challenge: Deletion by Value Solution: Deletion by Value Doubly Linked Lists (DLL)Singly Linked Lists vs. Doubly Linked Lists Challenge: Find the Length of a Linked List Solution: Find the Length of a Linked List Challenge: Reverse a Linked List Solution: Reverse a Linked List Challenge: Detect Loop in a Linked List Solution: Detect Loop in a Linked List Challenge: Find Middle Node of Linked List Solution: Find Middle Node of a Linked List Challenge: Remove Duplicates from Linked List Solution: Remove Duplicates from a Linked List Challenge: Union & Intersection of Linked Lists Solution: Union & Intersection of Linked Lists Challenge: Return the Nth Node from End Solution: Return the Nth Node from End Linked Lists Quiz: Test your understanding of Linked Lists

Introduction to Stacks and Queues

What is a Stack?Stack (Implementation)What is a Queue?Queue (Implementation)Challenge: Generate Binary Numbers from 1 to n using a Queue Solution: Generate Binary Numbers from 1 to n using Queue Challenge: Implement Two Stacks Using One List Solution: Implementing Two Stacks Using One List Challenge: Reversing First k Elements of Queue Solution: Reversing First k Elements of Queue Challenge: Implement a Queue Using Stacks Solution: Implement a Queue Using Stacks Challenge: Sort Values in a Stack Solution: Sort Values in Stack Challenge: Evaluate Postfix Expression Using a Stack Solution: Evaluate Postfix Expression Using a Stack Challenge: Next Greater Element Using a Stack Solution: Next Greater Element Using a Stack Challenge: Check Balanced Parentheses Using Stack Solution: Check Balanced Parentheses using Stack Challenge: min( ) Function Using a Stack Solution: min( ) Function Using a Stack Stack/Queue Quiz: Test your understanding of Stack/Queue

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 Challenge: Implement Breadth First Search Solution: Implement Breadth First Search Challenge: Implement Depth First Search Solution: Implement Depth First Search Challenge: Detect Cycle in a Directed Graph Solution: Detect Cycle in a Directed Graph Challenge: Find a "Mother Vertex" in a Directed Graph Solution: Find a "Mother Vertex" in a Directed Graph Challenge: Count the Number of Edges in an Undirected Graph Solution: Count the Number of Edges in an Undirected Graph Challenge: Check if a Path Exists Between Two Vertices Solution: Check if a Path Exists Between Two Vertices Challenge: Check if a Given Undirected Graph is Tree or not?Solution: Check if Given Undirected Graph is a Tree or Not Challenge: Find the Shortest Path Between Two Vertices Solution: Find the Shortest Path Between Two Vertices Challenge: Remove Edge Solution: Remove Edge Graph Quiz: Test your understanding of Graphs

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?

What is a Red-Black Tree?

Red-Black Tree Insertion

Red-Black Tree Deletion

What is a 2-3 Tree?

2-3 Deletion (Case #1)

2-3 Deletion (Case #2)

Overview of Trees

Challenge: Find minimum value in Binary Search Tree

Solution: Find minimum value in Binary Search Tree

Challenge: Find kth maximum value in Binary Search Tree

Solution: Find kth maximum value in Binary Search Tree

Challenge: Find Ancestors of a given node in a BST

Solution: Find Ancestors of a given node in a BST

Challenge: Find the Height of a BST

Solution: Find the Height of a BST

Challenge: Find Nodes at "k" distance from the Root

Solution: Find Nodes at "k" distance from the Root

Trees Quiz: Test your understanding of Trees

Trie

What is a Trie?Structure of a Trie Insertion in a Trie Search in a Trie Deletion in Trie Challenge: Total Number of Words in a Trie Solution: Total Number of Words in a Trie Challenge: Find All Words Stored in Trie Solution: Find All Words Stored in Trie Challenge: List Sort Using Trie Solution: List Sort Using Trie Challenge: Word Formation From a Dictionary Using Trie Solution: Word Formation From a Dictionary Using Trie Trie Quiz: Test Your Understanding of Tries

Introduction to Heap

What is a Heap?Max Heap: Introduction Max Heap (Implementation)Min Heap: Introduction Min Heap (Implementation)Challenge: Convert Max-Heap to Min-Heap Solution: Convert Max-Heap to Min-Heap Challenge: Find k Smallest Elements in a List Solution: Find k Smallest Elements in a List Challenge: Find k Largest Elements in the List Solution: Find k Largest Elements in the List Heap Quiz: Test your understanding of Heaps

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 Challenge: A List as a Subset of Another List Solution: A List as a Subset of Another List Challenge: Check if Lists are Disjoint Solution: Check if Lists are Disjoint Challenge: Find Symmetric Pairs in a List Solution: Find Symmetric Pairs in a List Challenge: Trace the Complete Path of a Journey Solution: Trace the Complete Path of a Journey Challenge: Find Two Pairs in List such that a+b = c+d Solution: Find Two Pairs Such That a+b = c+d Challenge: A Sublist with a Sum of 0 Solution: A Sublist with a Sum of 0 Challenge: Word Formation Using a Hash Table Solution: Word Formation Using a Hash Table Challenge: Find Two Numbers that Add up to "k" - Hashing Solution: Find Two Numbers that Add up to "k" - Hashing Challenge: First Non-Repeating Integer in a List - Hashing Solution: First Non-Repeating Integer in a List - Hashing Challenge: Detect Loop in a Linked List - Hashing Solution: Detect Loop in a Linked List - Hashing Challenge: Remove Duplicates from Linked List - Hashing Solution: Remove Duplicates from Linked List - Hashing Challenge: Union & Intersection of Linked Lists - Hashing Solution: Union & Intersection of Linked Lists - Hashing Hashing Quiz: Test your understanding of Hashing

Summary of Data Structures

Overview of Linear & Non-Linear Data Structures Conclusion

Trees Quiz: Test your understanding of Trees

Here are the top ten most commonly asked interview questions about trees

1

The total number of edges on the path from the root to a particular node is called that node’s

A)

Height

B)

Depth

C)

Length

D)

None of the above

Question 1 of 90 attempted

Level up your interview prep. Join Educative to access 70+ hands-on prep courses.