Discover data structures and algorithms using Python. Gain insights into solving real-world problems and typical interview questions with detailed reviews, explanations, and hands-on coding exercises.

Data structures and algorithms are among the most fundamental concepts of Computer Science. Whether it’s real-world problems you’re trying to solve or the typical coding question asked in an interview, almost every problem requires you to demonstrate a deep understanding of data structures and algorithms. 

This course is a detailed review of some of the most common data structures and algorithms that you’ll see in interviews and your everyday work. With implementation details, thorough explanations, and hands-on coding exercises, you’ll quickly gain the confidence you need to solve any problem, no matter the situation.

Data Structures and Algorithms in Python

Given that you have access to the head node of a circular linked list containing $n$ elements, what is the time complexity to search for an element?

Given that you have access to the head node of a circular linked list containing <math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>n</mi></mrow><annotation encoding="application/x-tex">n</annotation></semantics></math>n elements, what is the time complexity to search for an element?

A linked list is a circular linked list when the tail node points to itself. 

A linked list is a circular linked list when the tail node points to itself.

Given that you have access to the head node, the time complexity of removing the head node in a circular linked list containing $n$ elements is $O(1)$.

Given that you have access to the head node, the time complexity of removing the head node in a circular linked list containing <math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>n</mi></mrow><annotation encoding="application/x-tex">n</annotation></semantics></math>n elements is <math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>O</mi><mo stretchy="false">(</mo><mn>1</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">O(1)</annotation></semantics></math>O(1).

What is the output of the following code?
```python
cllist = CircularLinkedList()
cllist.append("A")
cllist.prepend("B")
cllist.prepend("C")
cllist.append("D")

cllist.remove("A")
cllist.remove("C")
print(cllist.head.data)
```

What is the output of the following code?
<pre><code class="language-python">cllist = CircularLinkedList()
cllist.append(&quot;A&quot;)
cllist.prepend(&quot;B&quot;)
cllist.prepend(&quot;C&quot;)
cllist.append(&quot;D&quot;)

cllist.remove(&quot;A&quot;)
cllist.remove(&quot;C&quot;)
print(cllist.head.data)
</code></pre>

What is the time complexity of the following method if we run it on a circular linked list containing $n$ elements?
```python
def print_list(self):
  cur = self.head 

  while cur:
      print(cur.data)
      cur = cur.next
      if cur == self.head:
          break
```

What is the time complexity of the following method if we run it on a circular linked list containing <math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>n</mi></mrow><annotation encoding="application/x-tex">n</annotation></semantics></math>n elements?
<pre><code class="language-python">def print_list(self):
 cur = self.head 

 while cur:
 print(cur.data)
 cur = cur.next
 if cur == self.head:
 break
</code></pre>

It's quiz time! Test yourself by solving these questions about circular linked lists.

Introduction

Stack

Singly Linked Lists

Circular Linked Lists

Doubly Linked Lists

Arrays

Binary Trees

Binary Search Trees

Binary Search

Recursion

String Processing

Quiz