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.


Important: You must answer <a href="https://www.interviewquery.com/questions/array-operations-fixed-length-arrays-1">this question</a> before attempting this one. We recommend copying your previous solution and iterating the new solution with the added operations.

Create a more extensive <code>Array</code> class simulating the functionality of fixed-size arrays. The array’s fixed size is <code>6</code>. In this question, we will be implementing the deletion and search operations.

<ul>
<li><code>pop_back() -&gt; element</code> - removes the last element of the array. Returns the removed element. If the array is empty, return <code>None</code>.</li>

<li><code>pop_front() -&gt; element</code> - removes the first element of the array. Returns the removed element. If the array is empty, return <code>None</code>.</li>

<li><code>pop(index) -&gt; element</code> - removes the element at the specified index and returns it. When the index is not in range, raise an <code>IndexError</code>.</li>

<li><code>search(element) -&gt; index</code> - searches for the specified element and returns the index of the first instance if it exists inside the array. Returns <code>-1</code> if the element does not exist inside the array. Example: <code>Array([1, 2, 3]).search(2) -&gt; 1</code>.</li>

<li><code>__contains__(element) -&gt; bool</code> - checks if the element exists inside the array. Returns <code>True</code> if it exists and <code>False</code> if it does not.</li>

<li><code>abolish(element) -&gt; count</code> - removes all instances of an element and returns the count of all removed instances.</li>

<li><code>__eq__(other) -&gt; bool</code> - checks the equality of the array with another array called <code>other</code>. Raises a <code>TypeError</code> if <code>other</code> is not an instance of this custom <code>Array</code> class.</li>
</ul>

Note: All the basic addition operations must be implemented first. (Refer to Fixed Length Arrays 1)

Implement a fixed-length array with addition, deletion, and search operations.

Data Structures and Algorithms Interview

Assessment 2 - Array Operations: Fixed-Length Arrays 2
Go to question details page

95%

Data Structures and Algorithms Interview

Assessment 2 - Array Operations: Fixed-Length Arrays 2Go to question details page

95%

Assessment 2 - Array Operations: Fixed-Length Arrays 2
Go to question details page