This course contains colorful visualizations and extensive explanations, all while allowing you to use your thinking cap and implement logic into code.

Data Structures and Algorithms Interview

Introduction

What Are Data Structures?

What is an Algorithm?

Assessment 1: Tower of Hanoi

Revisiting A Tower of Hanoi

Introduction to Data Structures and Algorithms

In this course, we will review what an array is, then cover the similarities and differences that they have with lists. 

Understanding Arrays

Array Operations (Addition)

Fixed Length Arrays: Addition

Array Operations (Deletion)

Assessment 2 - Array Operations: Fixed-Length Arrays 2

Array Time Complexity And Dynamic Arrays

N-Dimensional Arrays

Rapid-Fire Challenge 1: Arrays and Vectors

Arrays and Vectors

In this course, you will learn how linked list works. 

Introduction to Linked Lists

Linked List Operations

Assessment 1: Singly Linked Lists

Assessment 2: Pop Tail!

Linked Lists VS. Arrays

Assessment 3: Cyclic Detection

Assessment 4: Swapping Nodes

Linked List

In this course, we will be tackling the fundamental theory of data structures and algorithms. 

Unlock the power of efficient computing with proper data organization and manipulation through basic algorithms.


<p>Singly-linked lists are a type of linked list where nodes have only one pointer: A pointer to the next element. Create a class <code>SinglyLinkedList</code> along with its methods:</p>

<ul>
<li><code>add_head(element)</code> - adds an element to the head of the list. This becomes the new head of the linked list.</li>
<li><code>add_tail(element)</code> - adds an element to the tail of the list. This becomes the new tail of the linked list.</li>
<li><code>remove_head() -&gt; element</code> - removes the head and returns the value of the removed element.</li>
<li><code>remove_tail() -&gt; element</code> - removes the tail and returns the value of the removed element.</li>
<li><code>__contains__(item) -&gt; bool</code> - checks if the item is inside the list. Returns <code>True</code> if it is inside the list and returns <code>False</code> if not. This method is implemented to allow the use of Python’s <code>in</code> operator.</li>
<li><code>__getitem__(index)</code> - returns the element at the specified index. Raises an <code>IndexError</code> if the index is out of bounds. This method is implemented to allow the use of Python’s <code>[]</code> operator.</li>
<li><code>__len__()</code> - returns the length of the <code>SinglyLinkedList</code>.</li>
</ul>


Write a class 'SinglyLinkedList' that implements the interface required for a Singly Linked List.

Data Structures and Algorithms Interview

Assessment 1: Singly Linked Lists
Go to question details page

65%

Data Structures and Algorithms Interview

Assessment 1: Singly Linked ListsGo to question details page

65%

Assessment 1: Singly Linked Lists
Go to question details page