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.


Tower of Hanoi is a fun puzzle game that consists of a set of <code>3</code> pegs (<code>A</code>, <code>B</code>, <code>C</code>) and <code>n</code> number of disks. You are required to move all disks from the source peg <code>A</code> to destination peg <code>C</code>, under the following conditions:

<ul>
<li>You can only move one disk for each action.</li>
<li>You can only move the disk onto the top of another peg; you cannot place it off to the side or under existing disks.</li>
<li>You cannot place a larger disk onto a smaller disk.</li>
</ul>

Initially, all disks are on the source <code>A</code> peg and sorted by decreasing width from bottom to the top (widest on the bottom, smallest on the top).

You must develop an algorithm to move all disks from <code>A</code> to the destination peg <code>C</code> with the optimal solution. Also, return every step made from the starting state to the final state.

<img src="https://i.ibb.co/my0Vm13/initail.png" alt="alt"/>

<img src="https://i.ibb.co/0Ftzs7D/final.png" alt="alt"/>

Example

Input:

<pre tabindex="0" class="chroma"><code>n = 3
</code></pre>

Output:

<pre tabindex="0" class="chroma"><code>#return list of {&#34;A&#34;:[],&#34;B&#34;:[],&#34;C&#34;:[]} 
tower_of_hanoi_solver(n) -&gt; [
 {&#34;A&#34;: [1, 2, 3], &#34;B&#34;: [], &#34;C&#34;: []},
 {&#34;A&#34;: [2, 3], &#34;B&#34;: [], &#34;C&#34;: [1]},
 {&#34;A&#34;: [3], &#34;B&#34;: [2], &#34;C&#34;: [1]},
 {&#34;A&#34;: [3], &#34;B&#34;: [1, 2], &#34;C&#34;: []},
 {&#34;A&#34;: [], &#34;B&#34;: [1, 2], &#34;C&#34;: [3]},
 {&#34;A&#34;: [1], &#34;B&#34;: [2], &#34;C&#34;: [3]},
 {&#34;A&#34;: [1], &#34;B&#34;: [], &#34;C&#34;: [2, 3]},
 {&#34;A&#34;: [], &#34;B&#34;: [], &#34;C&#34;: [1, 2, 3]}
 ]
</code></pre>

What is the minimal number of steps needed to solve the Tower of Hanoi problem with n disks?

What is the minimal number of steps needed to solve the Tower of Hanoi problem with *n* disks?

Linear Data Structures

Tower of Hanoi

The Tower of Hanoi is a mathematical puzzle that consists of three rods and several discs of different sizes that can slide onto any rod. The puzzle starts with all the discs stacked on a single rod, the smallest disc at the top, making a cone shape.

The object of the puzzle is to move the entire stack to another rod, obeying these rules:

<ol>
<li>Only one disc can be moved at a time.

<ul>
<li>Each move consists of taking the upper disc from one of the stacks and placing it on top of another stack or an empty rod.09</li>
</ul></li>

<li>No larger disc may be placed on top of a smaller disc.</li>
</ol>

With these rules in mind, how would you approach solving the puzzle if there are three discs on the leftmost rod and your goal is to move them all to the rightmost rod?

Data Structures and Algorithms Interview

Assessment 1: Tower of Hanoi
Go to question details page

0%

Data Structures and Algorithms Interview

Assessment 1: Tower of HanoiGo to question details page

0%

Assessment 1: Tower of Hanoi
Go to question details page