# Data Structures in Python: An Interview Refresher (Coderust)

Trie - Structure of a Trie This lesson covers the structure of the Trie class in Python. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/JYQ4nXqvOLy). Introduction to Hashing - Add/Remove & Search in Hash Table (Implementation) This lesson will cover the Pythonic implementation for search, insertion, and deletion in hash tables. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/NEOy8qXDnZ6). Introduction to Hashing - A Quick Overview of Hash Tables Let's combine all the different operations discussed previously and test out the functionality of our complete hash table class. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/RMPGnRgXyoq). Introduction to Trees - Challenge 3: Find Ancestors of a given node in a BST If you are given the root to a Binary Search Tree and a node value "k", can you write a code to find the ancestor of that node? A solution is placed in the "solution" section for your help, but we would suggest you to solve it on your own first. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/xV6ErQrBBDB). Introduction to Hashing - Hashing Quiz: Test your understanding of Hashing Top ten most commonly asked interview questions about hashing will be covered in this lesson in the form of a quiz. Introduction to Lists - Challenge 1: Remove Even Integers from List Given a list of size n, remove all even integers from it. Implement this solution in Python and see if it runs without an error. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/3jwxgpxRq0n). Introduction to Trees - Challenge 5: Find Nodes at "k" distance from the Root If you are given the root to a Binary Search Tree and a node value "k", can you write a code to find the nodes at "k" distance from the root? A solution is placed in the "solution" section for your help, but we would suggest you to solve it on your own first. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/gkxWD7P7z8l). Introduction to Heap - Challenge 3: Find k largest elements in the List If you are given a list and any number "k", can you write a code to find first "k" largest elements using Max-Heap? View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/3jKnDqjJrkO). Introduction to Graphs - Types of Graphs This lesson showcases the two main categories of graphs. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/RMPjxLYLZXE). Introduction to Heap - Min Heap (Implementation) We'll implement a min heap in this lesson! View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/RMw7Vg8OyQO). Summary of Data Structures - Overview of Linear & Non-Linear Data Structures In this lesson, we will have review time complexities of all the data structures we have studied. We will also categorize them into linear and non-linear data structures. Introduction to Stack/Queues - Solution Review: Check Balanced Parentheses using Stack Have questions about Solution Review: Check Balanced Parentheses using Stack? Go for it! View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/B8OJlZDqO2o). Introduction to Linked Lists - Solution Review: Search in a Singly Linked List This review provides a detailed analysis of the different ways to solve the Search in a Singly Linked List challenge. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/qV2DQxJXZm2). Introduction to Linked Lists - Basic Linked List Operations This lesson lists the various operations that can be performed on linked lists View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/RM59PoJVLQE). Introduction to Trees - Solution Review: Find kth maximum value in Binary Search Tree This review provides a detailed analysis to solve the Find kth maximum value in Binary Search Tree challenge View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/qVM8EnY32E2). Introduction to Hashing - What is a Hash Table? This lesson is a brief introduction to the hash table data structure and the basic principle behind implementing it. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/q2pWP84GWmG). Introduction to Trees - Challenge 4: Find the Height of a BST Given the root to a Binary Search Tree, write a function to find the height of the tree. A solution is placed in the "solution" section for your help, but we would suggest you to solve it on your own first. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/xV1O4VALVLl). Introduction to Stack/Queues - Solution Review: Sort Values in Stack This review provides a detailed analysis of the different ways to solve the Sort Values in a Stack challenge. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/xV25LPr74Gr). Introduction to Graphs - Solution Review: Implement Breadth First Search This review provides a detailed analysis of the solution to the Implement Breadth First Search challenge. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/m2YAoKv725p). Introduction to Graphs - Solution Review: Count the Number of Edges in a Graph This review provides a detailed analysis of the solution to the Count the Number of Edges in Graph Challenge. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/JYlWlq5NO4P). Introduction to Trees - What makes a tree 'balanced'? In this chapter, we are going to study what makes a tree balanced. We are also going to look at a high-level description of the algorithm used to determine if a given tree is balanced. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/m2Y5QJpq4qn). Introduction to Trees - What is a Binary Tree? An introduction to binary trees and different types of binary trees View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/B81ORQLDYkX). Introduction to Hashing - Solution Review: Find Two Pairs Such That a+b = c+d This review provides a detailed analysis of the solution to the Find Two Pairs Such That a+b = c+d Challenge. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/m2OlOXzAY19). Introduction to Trees - Implementing a Binary Search Tree in Python In this lesson, we'll implement a very basic Binary Search Tree in Python View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/gx832Ar8JRr). Trie - Challenge 4: Word Formation From a Dictionary Using Trie This is a word matching problem regarding tries. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/qVVOv5M0YZ0). Introduction to Trees - Binary Search Tree Insertion (Implementation) In this chapter, we'll study the implementation of Binary Search Tree insertion in Python through the iterative and recursive approaches. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/qV2XANJp7q0). Introduction to Lists - Solution Review: Rearrange Positive & Negative Values This review provides a detailed analysis of the different ways to rearrange positive and negative values in a list. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/gx2gr0GzNY3). Introduction to Trees - What is an AVL Tree? This lesson is a brief introduction to AVL trees, why they are used, and what makes them more efficient than regular binary search trees. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/JYlwQZmN7V9). Introduction to Trees - What is a Red-Black Tree? This lesson is an introduction to Red-Black trees, their properties, and the total time they take to perform the operations of insertion, deletion, and searching. We will also do a small comparison between AVL and Red-Black Trees. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/YQy7Zlz1mEO). Introduction to Trees - What is a 2-3 Tree? This lesson is an introduction to 2-3 trees, its properties along with an example, and the basic operations that this data structure offers. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/YQlnqW9LAGn). Introduction to Trees - Challenge 1: Find minimum value in Binary Search Tree Given the root to a Binary Search Tree, write a function to find the minimum value in that tree. A solution is placed in the "solution" section for your help, but we would suggest you solve it on your own first. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/gxnp17EPRzk). Introduction to Stack/Queues - Solution Review: min() Function Using a Stack This review provides a detailed analysis of the different ways to solve the min() Function Using a Stack challenge. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5634727314718720/5643517367943168). Trie - Search in a Trie This lesson defines the algorithm for a word search in a trie. It also highlights the different scenarios which are taken care of in the algorithm. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/xV2YDD6XvYE). Trie - Challenge 1: Total Number of Words in a Trie For your first challenge regarding tries, you'll be writing a very commonly used function which gives us the trie word count. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/qVVAnylg0A2). Trie - Solution Review: List Sort Using Trie This review provides a detailed analysis of the solution to the Array Sort Using Tries Challenge. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/RM858Kk1yGE). Introduction to Heap - Min Heap: Introduction This lesson will give a brief introduction to Min-Heaps and how elements are inserted and removed from them View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/NE0MrPKAnWN). Introduction to Lists - Solution Review: List of Products of All Elements This review provides a detailed analysis of the different ways to find products of all elements in a list. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/B8r22gJMG2o). Introduction to Linked Lists - Singly Linked Lists (SLL) This lesson is a brief introduction to the functionality and purpose of the popular data structure called linked lists. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/xV60X8G2rqq). Introduction to Stack/Queues - Stack (Implementation) In this lesson, we are going to look at how Stacks are implemented in Python and how the main Stack functions actually work View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/qVLZJVy0r9y). Introduction to Graphs - Solution Review: Check if a Graph is a Tree or Not This review provides a detailed analysis of the different ways to solve the Count the Number of Edges in Graph Challenge. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/xV71zjJo5Gl). Introduction to Graphs - What is a Bipartite Graph? Now, we'll be introduced to a unique graph called the bipartite graph. We will also take a look at some examples to understand the concept better. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/YQVGRZo23rn). Introduction to Graphs - Challenge 5: Count Number of Edges in a Graph In this lesson, we will figure out if it's possible to count the total number of edges in a graph. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/mE8GgqAPVQG). Introduction to Trees - Searching in a Binary Search Tree (Implementation) This lesson about Searching in Binary Search Tree and how to implement searching functionality in Python. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/qV6ZpW6E1l2). Introduction to Trees - Pre-Order Traversal In this lesson, we will cover the traversal strategy, 'Pre-Order Traversal' in a Binary Search Tree, and its implementation it in Python View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/JPEZP93MvnP). Introduction to Hashing - Solution Review: Trace the Complete Path of a Journey This review provides a detailed analysis of the solution to the Trace the Complete Path of a Journey Challenge. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/RMk67M6EDM0). Introduction to Complexity Measures - Example 1: Measuring Time Complexity In this lesson, we are going to learn how to compute the running time complexity of an algorithm that involves loops. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/7nn1ggVyL7O). Introduction to Trees - Post-Order Traversal In this lesson, we will cover Post-Order Traversal in a Binary Search Tree and implement it in Python View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/7nW1mv3PYgw). Introduction to Hashing - Solution Review: Find Symmetric Pairs in a List This review provides a detailed analysis of the solution to the Find Symmetric Pairs in a List Challenge. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/qV2oN3P1VgG). Trie - Solution Review: Total Number of Words in a Trie This review provides a detailed analysis of the solution to the Total Number of Words in a Trie Challenge. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/B8n1PwX3Wyk). Introduction to Trees - Solution Review: Find Ancestors of a given node in a BST This review provides a detailed analysis of the different ways to solve the Find Ancestors of a given node in a Binary Tree challenge View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/m2GJqpnv633). Introduction to Heap - Solution Review: Convert Max-Heap to Min-Heap Have questions about Solution Review: Convert Max-Heap to Min-Heap? Go for it! View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/xooXDBg33P3). Introduction to Hashing - Solution Review: Word Formation Using a Hash Table This review provides a detailed analysis of the solution to the Word Formation Using a Hash Table Challenge. Introduction to Linked Lists - Solution Review: Return the Nth Node from End This review provides a detailed analysis of the different ways to return the nth node from the end of a linked list View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/qAxlo4lyWNk). Introduction to Graphs - Challenge 2: Implement Depth First Search After the BFS algorithm, we will now tackle the implementation for Depth First Search. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/qVA0EqnQy47). Introduction to Graphs - Challenge 9: Remove Edge In this challenge, we will learn how to delete an edge between two vertices. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/YQVRX9yE44O). Summary of Data Structures - Conclusion That’s a wrap! Introduction to Trees - 2-3 Deletion (Case #1) This lesson will cover the deletion operation in 2-3 trees, discussing all the four scenarios based on the position of the element which needs to be deleted. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/7nYr4EOr9pj). Introduction to Trees - 2-3 Insertion This lesson will explain how insertion is done in 2-3 Trees based on multiple scenarios which are explained in the insertion algorithm. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/YQQpm9ZBGx9). Introduction to Hashing - Challenge 5: Find Two Pairs in List such that a+b = c+d If you are given a list, can you find two pairs such that their sum is equal? View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/xVo1wBLA6wP). Introduction to Hashing - Challenge 6: A Sublist with a Sum of 0 In this exercise, we will find a sublist whose sum turns out to be zero. Let’s try it out! Introduction to Stack/Queues - Challenge 5: Sort Values in a Stack In this lesson, we will learn how to sort elements using a stack. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/B86pOQ6lZ1x). Introduction to Heap - Max Heap (Implementation) Let's implement a max Heap! View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/JPX181R2Vzv). Introduction to Complexity Measures - Challenge 2: Big O of Nested Loop with Subtraction Compute Big O of an algorithm which involves nested loops and the loop variables decrement with subtraction. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/qVAko0wprA2). Introduction to Linked Lists - Challenge 5: Reverse a Linked List Can we implement a program which could reverse a linked list? Let's find out. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/m2M3xXkp119). Introduction to Graphs - Solution Review: Implement Depth First Search This review provides a detailed analysis of the solution to the Implement Breadth First Search challenge. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/xV74rnoOlMr). Introduction to Graphs - Challenge 4: Find a "Mother Vertex" in a Graph Given a graph, can you find a vertex from which all other vertices are reachable? View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/7nODy1vm2vj). Introduction to Trees - Binary Search Tree Insertion In this lesson, we'll study the binary search tree insertion algorithm! View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/JYQrzKqNv62). Introduction to Trees - More on Complete Binary Trees In this lesson, we are going to discuss what Complete Binary Trees are and how elements are inserted into them. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/B8OO5pV8Nrk). Introduction to Trees - In-Order Traversal In this lesson, we will cover In-Order Traversal and implement it in Python View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/qVl5XoGYy3R). Introduction to Trees - What is a Binary Search Tree (BST)? This lesson will introduce Binary Search Trees and their properties View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/YQqnOlXpM62). Introduction to Trees - Red-Black Tree Insertion This lesson will cover the insertion operation in Red-Black trees, discussing all the four insertion cases. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/JYYlrMG81yD). Trie - Trie Quiz: Test Your Understanding of Tries We're at the end of our discussion on tries. Here are a few follow up questions to reinforce your concepts. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/3jwm7oJL2Xn). Introduction to Graphs - Representation of Graphs Two approaches to represent a graph will be covered in this lesson. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/RMP2RPWZZZq). Introduction to Hashing - Building a Hash Table from Scratch This lesson is about how hash tables are implemented in Python. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/B8ODKWQVq02). Trie - What is a Trie? This lesson gives a brief introduction to Trie, its properties, and common applications. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/NEppYyRy6AL). Trie - Deletion in Trie After insertion and search, let's figure out the logic behind deletion in tries. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/RMwYKYJ78M0). Introduction to Trees - Deletion in a Binary Search Tree (Implementation) We will now write the implementation of the deletion function which covers all the cases that we discussed previously View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5634727314718720/5708977300045824). Introduction to Heap - What is a Heap? A brief introduction to Heaps and their uses. We will also discuss the Heap property and how a heap is implemented. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/g75kWBBLxPG). Introduction to Heap - Solution Review: Find k smallest elements in a List Have questions about Solution Review: Find k smallest elements in a List? Go for it! View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/7nXr82XK0Xr). Introduction to Heap - Solution Review: Find k Largest Elements in the List Have questions about Solution Review: Find k Largest Elements in the List? Go for it! View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/qVDplDnGQB2). Introduction to Stack/Queues - Challenge 9: min() Function Using a Stack Using your knowledge, create an efficient min() function using a stack. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5634727314718720/5707203478552576). Introduction to Hashing - The Hash Function This is the first building block of a hash table. Let's see how it works. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/NEXVMogN03p). Introduction to Hashing - Challenge 1: A List as a Subset of Another List Can you find whether a given list is a subset of another list by using a hash table? View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/gxx4Ro4LqY3). Introduction to Trees - Overview of Trees A quick overview of trees, its types, and some important formulas to compute height and number of nodes in a tree. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/m2q5xZDZrMp). Introduction to Trees - Challenge 2: Find kth maximum value in Binary Search Tree Given the root to a Binary Search Tree and a number "k" write a function to find the kth maximum value in the tree. A solution is placed in the "solution" section for your help, but we would suggest you to solve it on your own first. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/m2Eg0No00Mp). Introduction to Trees - Solution Review: Find the Height of a BST Have questions about Solution Review: Find the Height of a BST? Go for it! View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/m27o0ApOmpR). Introduction to Trees - Red-Black Tree Deletion This lesson will cover the deletion function in Red-Black trees and will discuss all four deletion cases. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/mENKnV3q4qn). Trie - Insertion in a Trie This lesson defines all the cases needed for inserting a word into a trie, along with the Pythonic implementation. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/gx8VE9Y5llD). Introduction to Linked Lists - Solution Review: Find the Length of a Linked List This review provides a detailed analysis of the solution to the Find the Length of a Linked List challenge. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/B8nZvpkRDNW). Introduction to Complexity Measures - Solution Review: Big O of Nested Loop with Addition This review provides a detailed analysis of the time complexity of the Nested Loop with Addition problem! View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/qVLpJ3y5gJr). Trie - Challenge 3: List Sort Using Trie This lesson is about sorting string lists using tries. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/gxpQ1yvLPz9). Introduction to Linked Lists - Challenge 1: Insertion at Tail Now, we'll tackle the second insertion strategy in linked lists. However, you will be the one implementing it! View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/YQ5l1Gx3OnY). Introduction to Trees - Skewed Binary Trees In this lesson, we will discuss another type of Binary Tree called Skewed Binary Tree. We will look at some of its properties and types. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/YVvDNvyYNRW). Introduction to Graphs - Graph Quiz: Test your understanding of Graphs Here are the ten most commonly asked interview questions about graphs. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/m2YPGvDRgQp). Introduction to Complexity Measures - Solution Review: Big O of Nested Loop with Multiplication This review provides a detailed analysis of the different ways to solve the Big O of Nested Loop with Multiplication Quiz! View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/xVo6KLGVNB3). Introduction to Linked Lists - Challenge 4: Find the Length of a Linked List Let's write a function which can tell us the length of a linked list. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/qVZBQMAN1zD). Introduction to Graphs - Challenge 8: Find the Shortest Path Between Two Vertices We've dealt with several graph traversals. Now, we'll find the shortest path traversal between to vertices. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/qVl6g4PWYEk). Introduction to Linked Lists - Solution Review: Detect Loop in a Linked List This review provides a detailed analysis of the different ways to solve the Detect a Loop in a Linked List challenge. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/m7yj6NGOyjp). Introduction to Lists - Challenge 2: Merge Two Sorted Lists Given two sorted lists, merge them into one list which should also be sorted. Implement the solution in Python and see if your code runs successfully! View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/xV2WB4rl0lq). Introduction to Hashing - Solution Review: A Sublist with a Sum of 0 This review provides a detailed analysis of the solution to the A Sublist with a Sum of 0 Challenge. Introduction to Stack/Queues - What is a Stack? An introduction to the Stack data structure, its uses and functionality. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/3j9OjXEKJwn). Introduction to Linked Lists - Solution Review: Insertion at Tail This review provides a detailed analysis of the solution to the Insertion at Tail challenge. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/xVoEw218EOE). Introduction to Trees - AVL Insertion This lesson will cover the insertion operation in AVL trees, discussing all the four insertion cases. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/qVDlKBGDE6y). Introduction to Trees - Trees Quiz: Test your understanding of Trees Here are the top ten most commonly asked interview questions about trees View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/qVZqgLvZz4r). Introduction to Linked Lists - Challenge 2: Search in a Singly Linked List This lesson explains how searching is done in a singly linked list. There is also a coding exercise to test your concepts. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/B8ND20nz9Kx). Introduction to Lists - Challenge 8: Right Rotate List Given a list, can you rotate its elements by one index from right to left? Implement your solution in Python and see if your code runs successfully! View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/gx66VJRNY3Y). Introduction to Hashing - Challenge 3: Find Symmetric Pairs in a List Now we will implement a symmetry detection algorithm using hash tables. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/qVL50O7ykw0). Introduction to Graphs - Challenge 3: Detect Cycle in a Directed Graph Here's another coding challenge on directed graphs. You'll implement a cool function which detects loops! View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/m282ExAxXR0). Introduction to Hashing - Challenge 7: Word Formation Using a Hash Table We solved this problem using tries. Now, let’s try it out with hash tables. Introduction to Complexity Measures - Other Common Asymptotic Notations and Why Big O Trumps Them This lesson covers the various asymptotic notations for algorithms and why computer scientists prefer Big O instead of other notations. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/JYYpmPpB1vD). Introduction to Linked Lists - Singly Linked Lists vs. Doubly Linked Lists Let's see how the two renditions of the linked list structure fare against each other. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/gx6lVB0D4xl). Introduction to Graphs - Solution Review: Remove Edge This review provides a detailed analysis of the solution to the Remove Edge Challenge. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/N8p3DrNwLjN). Introduction to Graphs - What is a Graph? This lesson is a brief introduction to the graph data structure, its types, and the standard terminologies used to describe it. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/gxQ283421q9). Introduction to Complexity Measures - Solution Review: Nested Loop with Multiplication (Intermediate) This review provides a detailed analysis of the different ways to solve the nested loop with multiplication in an advanced problem! View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/gx63N19xrDY). Introduction to Graphs - Graph Traversal Algorithms In this lesson, we will learn the basic logic behind graph traversal and see how it can be done with two most famous graph traversal algorithms. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/gx8NKY3J326). Introduction to Complexity Measures - Challenge 1: Big O of Nested Loop with Addition Compute the Big O complexity of an algorithm which involves nested loops where the loop variables increase with addition. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/m2MMRvzkxDO). Introduction to Stack/Queues - What is a Queue? This lesson gives an introduction to the queue data structure, its various uses, and types. We will also go through the inner workings of a Queue by briefly discussing each of its functions. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/xV8qOgDqL2r). Introduction to Stack/Queues - Solution Review: Next Greater Element Using a Stack This review provides a detailed analysis of the different ways to solve the Next Greater Element Using a Stack challenge. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/qVVR3oRmJ10). Introduction to Trees - 2-3 Deletion (Case #2) How do we delete an element present at an internal node? It will be explained in this lesson with the help of an example. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/3jOgAg9Rn1p). Introduction to Stack/Queues - Challenge 2: Implement Two Stacks Using One List Can you implement two stacks using a single array? A solution is placed in the "solution" section for your help, but we would suggest you to solve it on your own first. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/qVZZkJE4Vkp). Introduction to Linked Lists - Challenge 6: Detect Loop in a Linked List Loops in linked lists can be dangerous as they can end up programs iterating linked lists indefinitely. Now, you'll create an algorithm to detect them. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/B88MAk7xX4x). Introduction to Linked Lists - Challenge 9: Union & Intersection of Linked Lists In this lesson, linked lists meet data set operations. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/3j6jX9GyZz4). Introduction to Lists - Challenge 3: Find Two Numbers that Add up to "k" Given a list and a number "k", find two numbers from the list that sum to "k". View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/xVl0WZ09nY9). Introduction to Linked Lists - Challenge 10: Return the Nth node from End Returning the Nth node from the start of a linked list is easy. Can you return Nth node from the end of a list? View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/xVVZ8zPYJRJ). Introduction to Heap - Heap Quiz: Test your understanding of Heaps Here are the top ten most commonly asked interview questions on heaps! View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/JYlKD88AAPD). Introduction to Heap - Max Heap: Introduction This lesson will give a brief introduction to Max-Heaps and how their elements are inserted or removed from Max-Heaps. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/B81K0P3EEGN). Introduction to Trees - 2-3-4 Trees This lesson is a brief introduction to 2-3-4 Trees. We will discuss its key features and take a look at its examples. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/B8RgJVp9gG2). Introduction to Complexity Measures - Comparing Algorithms This chapter will cover different types of complexity measures like Big O and their uses. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/xVVyKOr31Qn). Introduction to Heap - Challenge 1: Convert Max-Heap to Min-Heap Given a Max-Heap convert it into a Min-Heap. A solution is placed in the "solution" section for your help, but we would suggest you solve it on your own first. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/qV2o0WkVmp3). Introduction to Linked Lists - Solution Review: Deletion by Value This review provides a detailed analysis of the different ways to solve the Deletion by Value challenge. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/N81GDNOm4mK). Introduction to Linked Lists - Linked Lists Quiz: Test your understanding of Linked Lists Top ten most commonly asked interview questions about linked list will be covered in this lesson in the form of a quiz. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/JYzXBmLzR02). Introduction to Linked Lists - Doubly Linked Lists (DLL) After singly linked lists, we've come to the more evolved version of the linked list data structure: doubly linked lists. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/JPWmDJVL3WJ). Introduction to Graphs - Complexities of Graph Operations Let's discuss the performance of the two graph representations. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/3jjlnyyOrRR). Introduction to Complexity Measures - Solution Review: Nested Loop with Multiplication (Pro) This review provides a detailed analysis of the different ways to solve the Nested Loop with Multiplication challenge View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/JYNY1nmjxOg). Introduction to Trees - Solution Review: Find Nodes at "k" distance from the Root This review provides a detailed analysis of the different ways to solve the Find Nodes at "k" distance from the Root challenge. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/B86lYWRjBJW). Introduction to Complexity Measures - Example 2: Measuring Time Complexity Compute time complexity of a given algorithm with nested loops. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/m2MloJQz0wA). Introduction to Complexity Measures - Introduction to Asymptotic Analysis and Big O Asymptotic analysis is a way to classify the running time complexity of algorithms. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/qVQq0WLjO3p). Introduction to Heap - Challenge 2: Find k smallest elements in a List Given a list and a number "k" write a function that returns the first "k" smallest elements using a Heap? View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/NEXkowGmAlN). Trie - Solution Review: Find All Words Stored in Trie This review provides a detailed analysis of the solution to the Find All Words Stored in Trie Challenge. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/3jOzvwORQY9). Introduction to Linked Lists - Linked Lists vs. Lists Let's pit the two data structures against each other to find out which is more efficient. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/qVVrwx1VWB2). Introduction to Complexity Measures - Useful Formulas In this lesson, we'll study some mathematical formulae that make calculating time complexity easier! View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/xVlqk4xQyVJ). Trie - Solution Review: Word Formation From a Dictionary Using Trie This review provides a detailed analysis of the solution to the Word Formation From a Dictionary Using a Trie Challenge. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/xV15l6xk2z3). Introduction to Trees - Trees and their Basic Properties! In this chapter, we are going to study the basics of the tree data structure! View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/qVMzgL0nZAk). Introduction to Graphs - Solution Review: Check if a Path Exists Between Two Vertices This review provides a detailed analysis of the solution to the Check if a Path Exists Between Two Vertices Challenge. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/3jyPyvLWGgO). Introduction to Lists - Challenge 5: Find Minimum Value in List Given a list of size ‘n,’ can you find the minimum value in the list? Implement your solution in Python and see if your output matches the expected output. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/RMlvBQ7YRgR). Introduction to Graphs - Solution Review: Find the Shortest Path Between Two Vertices This review provides a detailed analysis of the solution to the Find the Shortest Path Between Two Vertices Challenge. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/3j9zjEBkWzx). Introduction to Hashing - Challenge 2: Check if Lists are Disjoint Building upon the previous challenge, we will learn how to check if two sets are disjoint. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/399kZ1rn1BO). Introduction to Lists - Solution Review: First Non-Repeating Integer in a list This review provides a detailed analysis of the different ways to find the first non-repeating integer in a list. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/xV61MjxyKB3). Introduction to Graphs - Solution Review: Find a "Mother Vertex" in a Graph This review provides a detailed analysis of the different ways to solve the Find "Mother Vertex" in a Graph challenge. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/B81ovLMVA6J). Introduction to Hashing - Solution Review: Check if Lists are Disjoint This review provides a detailed analysis solution to the Check if Lists are Disjoint Challenge. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/gx7GOxNAwj3). Introduction to Linked Lists - Solution Review: Remove Duplicates from a Linked List This review provides a detailed analysis of the different ways to solve the Remove Duplicates from a Linked List challenge. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/7An88W8MAoO). Introduction to Linked Lists - Solution Review: Union & Intersection of Linked Lists This review provides a detailed analysis of the different ways to solve the Union and Intersection of Linked Lists challenge. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/393Y8kjG69r). Introduction to Trees - Deletion in a Binary Search Tree In this lesson, we are going to learn how nodes are deleted in binary search trees. We will take a look at a few node deletion scenarios and what to do in each one. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/gxpKvxzoR9Y). Introduction to Graphs - Challenge 7: Check if Given Graph is Tree or not? In this lesson, we will learn the difference between a graph and a tree. You will use this knowledge for the challenge below. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/qVDXOZ0pnzD). Introduction to Trees - AVL Deletion This lesson will cover the deletion operation in AVL trees, discussing all the four deletion cases. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/mEk795JlkxE). Introduction to Trees - Solution: Find minimum value in Binary Search Tree This review provides a detailed analysis of the different ways to solve the Find minimum value in Binary Search Tree challenge View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/qVZ8RlDlgR3). Introduction to Hashing - Challenge 4: Trace the Complete Path of a Journey Test your knowledge on hash table traversal with this coding exercise! View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/m2OlZ3VD36A). Trie - Challenge 2: Find All Words Stored in Trie If you are given a trie, can you return every word it contains? View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/B89ALZByqNW). Introduction to Hashing - Trees vs Hash Table This lesson highlights the differences between trees and hash tables. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/YMZYqO21yYK). Introduction to Stack/Queues - Solution Review: Implement a Queue Using Stacks This review provides a detailed analysis of the different ways to solve the Implement a Queue Using Stacks challenge. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/3jwZDxXNZWx). Introduction to Linked Lists - Singly Linked List Deletion After insertion and search, we'll be tackling the concept of deletion in a linked list. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/3jVJvRkDJ5M). Introduction to Lists - Challenge 9: Rearrange Positive & Negative Values Given a list, can you rearrange its elements in such a way that the negative elements appear at one end and positive elements appear at the other? Solve this problem in Python and see if your code runs correctly! View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/B86DK3l1VQX). Introduction to Hashing - Solution Review: A List as a Subset of Another List This review provides a detailed analysis of the solution to the A List as a Subset of Another List Challenge. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/qVQzYYrB3w0). Introduction to Hashing - Collisions in Hash Tables This lesson is about how collisions occur in hashing and the common strategies used in resolving these collisions. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/7nA4LrGpQzj). Introduction to Complexity Measures - Common Complexity Scenarios This lesson summarizes our discussion of complexity measures and includes some commonly used examples and handy formulas to help you with your interview. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/qVL4zjAERLk). Introduction to Lists - Lists vs Arrays in Python Have questions about Lists vs Arrays in Python? Go for it! View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/qVZQgv08KQr). Introduction to Stack/Queues - Challenge 7: Next Greater Element Using a Stack Using a stack, can you implement a function to find the next greater element after any given element in a list? View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/gxp1O56Jw16). Introduction to Stack/Queues - Solution Review: Reversing First k Elements of Queue Have questions about Solution Review: Reversing First k Elements of Queue? Go for it! View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/qVVzL3XK9Kr). Introduction to Linked Lists - Challenge 8: Remove Duplicates from Linked List In this lesson, you must figure out the Pythonic solution for removing duplicates from a linked list. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/qVV2BA033M0). Introduction to Linked Lists - Solution Review: Find Middle Value of a Linked List This review provides a detailed analysis of the different ways to solve the Find the Middle Value in a Linked List challenge. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/qVQY2PYEOLG). Introduction to Complexity Measures - Solution Review: Nested Loop with Multiplication (Basic) This review provides a detailed analysis of the different ways to solve the nested loop with multiplication problem View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/3jwJB6DqZGp). Introduction to Graphs - Challenge 1: Implement Breadth First Search Now, we shall implement the BFS algorithm in Pythonic code. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/YQ7jOBvY1LM). Introduction to Lists - Solution Review: Find Second Maximum Value in a List This review provides a detailed analysis of the different ways to find second maximum value in a list. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/7AYVKw99NPO). Introduction to Graphs - Challenge 6: Check if a Path Exists Between Two Vertices Given a graph and two vertices, can you write a code to check if a path exists between the two vertices? View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/gx20Z1kO9lD). Introduction to Complexity Measures - Solution Review: Nested Loop with Multiplication (Advanced) This review provides a detailed analysis of the different ways to solve the Nested Loop with Multiplication challenge. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/qVLMqR4nYJ7). Introduction to Complexity Measures - Complexity Quiz: Test your understanding of complexity The top ten most commonly asked interview questions about complexity measure will be covered in this lesson in form of a quiz. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/gxQxZy2PrDY). Introduction to Lists - Solution Review: Rearrange Sorted List in Max/Min Form This lesson gives a solution to the challenge in the previous lesson. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/qVD52x8PKv7). Introduction to Lists - Lists In this lesson, we define lists, how they are used in Python and how they are different from arrays! View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/gx2vRWpY693). Introduction to Lists - Solution Review: Merge Two Sorted Lists This review provides a detailed analysis of the different ways merge two sorted lists. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/m27w97QNJER). Introduction to Linked Lists - Challenge 3: Deletion by Value Based on how we handled the deletion at head strategy, let's write the function for deletion by value. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/7nD1Wx97jY1). Introduction to Linked Lists - Singly Linked List Insertion Let's look at the Pythonic implementation for the insertion of a node in a linked list. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/7n9V6y6KzB8). Introduction to Stack/Queues - Queue (Implementation) Lets look at the basic functionality and implementation of queues in Python! View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/3jEMN9WmyY4). Introduction to Lists - Arrays In this lesson, we learn about arrays and how they are used in Python! View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/JYlGlXpOP62). Introduction to Stack/Queues - Solution Review: Evaluate Postfix Expression Using a Stack This review provides a detailed analysis of the different ways to solve the Evaluate Postfix Expression Using Stack challenge. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/gxQZEG41nkY). Introduction to Stack/Queues - Challenge 1: Generate Binary Numbers from 1 to n using a Queue Can you generate binary numbers from 1 to any given number "n"? View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/m2NMgL057Y9). Introduction to Linked Lists - Challenge 7: Find Middle Value of Linked List Here's another interesting coding challenge to test your knowledge on linked lists. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/7nOL3Yqolkw). Introduction to Lists - Solution Review: Find Minimum Value in List This review provides a detailed analysis of the different ways to find a minimum value in a list. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/7nOArvZnQjG). Introduction to Graphs - Graph Implementation This lesson will cover the implementation of a directed graph via adjacency list in Python. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/NE8lYwzMKjN). Introduction to Stack/Queues - Challenge 4: Implement a Queue Using Stacks We have seen the difference between stacks and queues, but is it possible to make one from the other? Let's find out. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/RMO3vyG2MBq). Introduction to Lists - Lists Quiz: Test your understanding of Lists Top ten most commonly asked interview questions about lists will be covered in this lesson in form of a quiz. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/B8RzjwGl7zN). Introduction to Lists - Solution Review: Find Two Numbers that Add up to "k" This review provides a detailed analysis of the different ways to solve the find two numbers that add up to k. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/7nOqNj0x52j). Introduction to Complexity Measures - Challenge 3: Big O of Nested Loop with Multiplication Compute Big O of an algorithm which involves nested loops and the loop variables increment with multiplication. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/JYPElD65lKD). Introduction to Lists - Challenge 4: List of Products of all Elements Given a list, modify it so that each index stores the product of all elements in the list except the element at the index itself. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/7nYN4DBMBDA). Introduction to Stack/Queues - Solution Review: Generate Binary Numbers from 1 to n using Queue Have questions about Solution Review: Generate Binary Numbers from 1 to n using Queue? Go for it! View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/m27LvN2DQQG). Introduction to Complexity Measures - Challenge 5: Nested Loop with Multiplication (Intermediate) A more complex exercise based on the Big O of an algorithm which involves nested loops and the loop variables increment with multiplication. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/RMwpJkR4qOK). Introduction to Lists - Challenge 7: Find Second Maximum Value in a List Given a list of size n, can you find the second maximum element in the list? Implement your solution in Python and see if your output matches the correct output! View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/YQrnlJ3kx80). Introduction to Complexity Measures - Challenge 4: Nested Loop with Multiplication (Basic) This is a little-advanced exercise based on the Big O of an algorithm which involves nested loops and the loop variables increment with multiplication. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/3jyOpEnD71Q). Introduction to Lists - Challenge 6: First Non-Repeating Integer in a list Given a list, find the first integer which is unique in the list. Unique means the number does not repeat and appears only once in the whole list. Implement your solution in Python and see if it runs correctly! View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/m274vRXDnMp). Introduction to Lists - Solution Review: Right Rotate List This review provides a detailed analysis of the different ways to right rotate the list. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/3jjM59RB6Wx). Introduction to Stack/Queues - Challenge 6: Evaluate Postfix Expression Using a Stack Let's try to compute postfix mathematical expressions using stacks! View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/B81w73oM5xX). Introduction to Stack/Queues - Solution Review: Implementing Two Stacks Using One List This review provides a detailed analysis of the different ways to solve the Implementing Two Stacks using one Array challenge View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/gx6PV9R6V2j). Introduction to Lists - Challenge 10: Rearrange Sorted List in Max/Min Form Arrange elements in such a way that the maximum element appears at first position, then minimum at second, then second maximum at third and second minimum at fourth and so on. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/JYN49kBN912). Introduction to Complexity Measures - Challenge 7: Nested Loop with Multiplication (Pro) A pro-level exercise based on the Big O of an algorithm which involves nested loops and the loop variables increment with multiplication and addition. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/gxQyDzZnQWZ). Introduction to Stack/Queues - Challenge 3: Reversing First k Elements of Queue Can you reverse first "k" elements in a given queue? A solution is placed in the "solution" section for your help, but we would suggest you solve it on your own first. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/YQlj7zyOKPW). Introduction to Stack/Queues - Challenge 8: Check Balanced Parentheses Using Stack If you are given an expression, can you check if its parentheses are balanced? A solution is placed in the "solution" section for your help, but we would suggest you to solve it on your own first. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/B8ngEo1ZDLQ). Introduction to Stack/Queues - Stack/Queue Quiz: Test your understanding of Stack/Queue Top ten most commonly asked interview questions about stack and queue will be covered in this lesson in the form of a quiz. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/7n9YVj2Mp2B). Introduction to Complexity Measures - Solution Review: Big O of Nested Loop with Subtraction This review provides a detailed analysis of the time complexity of the Nested Loop with Subtraction problem! View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/7n93n6r2Ypj). Introduction to Linked Lists - Solution Review: Reverse a Linked List This review provides a detailed analysis of the different ways to solve the Reverse a Linked List challenge. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/mEGmE5owE4O). Introduction to Complexity Measures - Challenge 6: Nested Loop with Multiplication (Advanced) A more advanced exercise based on the Big O of an algorithm which involves nested loops and the loop variables increment with multiplication. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/R8zEGjVny9L). Introduction to Lists - Solution Review: Remove Even Integers from a List This review provides a detailed analysis of the different ways to remove even integers from a list. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/xVVAwngJ3x9). Introduction to Graphs - Solution Review: Detect Cycle in a Directed Graph This review provides a detailed analysis of the solution to the Detect a Cycle in a Direct Graph challenge. View the lesson [here](https://www.educative.io/courses/data-structures-in-python-an-interview-refresher/NEOrzNE8Znm).

About the Data Structures in Python: An Interview Refresher (Coderust) category
[Data Structures in Python: An Interview Refresher (Coderust)]
(1)

Pls help me In example 2 quick quiz, thxxxx
[Introduction to Complexity Measures - Example 2: Measuring Time Complexity]
(2)

Time Complexity for unioning linked list
[Introduction to Linked Lists - Solution Review: Union & Intersection of Linked Lists]
(1)

Example 1: Measuring Time Complexity, confused about print(sum)
[Introduction to Complexity Measures - Example 1: Measuring Time Complexity]
(1)

Differences with insertion and deletion at tail
[Introduction to Linked Lists - Linked Lists vs. Lists]
(2)

Am I misunderstanding how solution 1 works?
[Introduction to Lists - Solution Review: Merge Two Sorted Lists]
(3)

Example 1: Measuring Time Complexity range(n) and sum+=1
[Introduction to Complexity Measures - Example 1: Measuring Time Complexity]
(4)

Is the complexity table/count correct?
[Introduction to Complexity Measures - Common Complexity Scenarios]
(1)

Example 1: Measuring Time Complexity Math Question
[Introduction to Complexity Measures - Example 1: Measuring Time Complexity]
(1)

I'm confused when comparing challenge 7 to challenge 3, why does challenge 3 need to use a recursive function on every vertex (line9-line11) to detect a cycle while challenge 7 doesn't?
[Introduction to Graphs - Challenge 7: Check if Given Graph is Tree or not?]
(1)

Quiz number 8: why not B)
[Introduction to Lists - Lists Quiz: Test your understanding of Lists]
(3)

Not fully understanding this solution
[Introduction to Complexity Measures - Solution Review: Big O of Nested Loop with Multiplication]
(2)

Confused about time complexity
[Introduction to Complexity Measures - Solution Review: Nested Loop with Multiplication (Pro)]
(2)

Intro to Linked Lists - Insertions at tail
[Introduction to Linked Lists - Solution Review: Insertion at Tail]
(1)

Example 1: Measuring Time Complexity
[Introduction to Complexity Measures - Example 1: Measuring Time Complexity]
(1)

G.P 1+2+4+8+16+....+n
[Introduction to Complexity Measures - Solution Review: Big O of Nested Loop with Multiplication]
(1)

Time complexity for n=10
[Introduction to Complexity Measures - Example 1: Measuring Time Complexity]
(1)

Thoughts about 3rd solution?
[Introduction to Lists - Solution Review: List of Products of All Elements]
(4)

Purely adapted from another language
[Data Structures in Python: An Interview Refresher (Coderust)]
(2)

Simpler implementation?
[Introduction to Linked Lists - Solution Review: Find Middle Value of a Linked List]
(2)

Example 1 : Measuring Time Complexity
[Introduction to Complexity Measures - Example 1: Measuring Time Complexity]
(2)

Shorter variant
[Introduction to Lists - Solution Review: Rearrange Sorted List in Max/Min Form]
(3)

Second maximum task may need clarification
[Introduction to Lists - Solution Review: Find Second Maximum Value in a List]
(3)