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.


Create an <code>Array</code> class simulating the functionality of fixed-size arrays. The array’s size is <code>6</code>. The array’s constructor is already defined:

<pre tabindex="0" class="chroma"><code>class Array:

 def __init__(self):
 pass # Dynamically added to avoid tampering
 self._count = 0
 self._array = [None, None, None, None, None, None]
 self._MAX_CAPACITY = 6
</code></pre>

There is no need to implement the constructor. In the code editor, <code>__init__</code> will contain <code>pass</code>. The constructor’s code will be added dynamically to avoid any changes.

The <code>Array</code> class should have the following methods:

<ul>
<li><code>__len__()</code>: Returns the length of the array. For example, if the array is <code>[1, 2, None, None, None, None, None]</code>, <code>__len__()</code> will return <code>2</code>.</li>

<li><code>__getitem__(index)</code>: Returns the element at the specified index. Raises an <code>IndexError</code> when the index is out of range.</li>

<li><code>emplace_back(element)</code>: Places an element at the back of the array. Raises an <code>ArrayFull</code> exception when the array is full (length &gt; 6).</li>

<li><code>emplace_front(element)</code>: Places an element at the front of the array. Raises an <code>ArrayFull</code> exception when the array is full (length &gt; 6).</li>

<li><code>emplace(element, index)</code>: Places an element at the specified index. Raises an <code>ArrayFull</code> exception when the array is full (length &gt; 6).</li>
</ul>

Note: <code>ArrayFull</code> is already implemented. To raise it, simply use <code>raise ArrayFull()</code>.

Implement the addition operations of fixed length arrays.

Data Structures and Algorithms Interview

Fixed Length Arrays: Addition
Go to question details page

70%

Data Structures and Algorithms Interview

Fixed Length Arrays: AdditionGo to question details page

70%

Fixed Length Arrays: Addition
Go to question details page