Queues and Deques in TypeScript: Concepts and Implementations | CodeSignal Learn

Queues and Deques in TypeScript: Concepts and Implementations | CodeSignal Learn

Lesson Overview

Welcome to our exploration of queues and deques . These structures are pivotal in programming, managing everything from system processes to printer queues. In this lesson, our goal is to understand and implement queues and deques using TypeScript. Let's dive in!

Introduction to Queues

A queue, much like waiting in line at a store, operates on the "First In, First Out," or FIFO, principle. Using TypeScript, we can implement queues with arrays. This involves methods such as push() for adding items and shift() for removing them. TypeScript // Create a queue and add items let queue: string[] = []; queue.push("Apple"); queue.push("Banana"); queue.push("Cherry"); // Remove an item console.log(queue.shift()); // Expects "Apple" The dequeued item, "Apple", was the first item inserted, showcasing the FIFO nature of queues.

Practical Implementation of Queues

Before calling shift(), which removes the first element from the queue, it's important to verify that the queue isn't empty. This check (queue.length > 0) prevents errors that occur when trying to remove an element from an empty array, as shift() returns undefined when the array is empty. TypeScript // Create a queue and enqueue items let queue: string[] = []; queue.push("Item 1"); queue.push("Item 2"); // Check if the queue is non-empty, then dequeue an item if (queue.length > 0) {console.log(queue.shift()); // Expects "Item 1"}

Why Arrays for Queues?

O(1)

Sign up

Join the 1M+ learners on CodeSignal

Be a part of our community of 1M+ users who develop and demonstrate their skills on CodeSignal

Introduction to Deques

A deque, or "double-ended queue," allows the addition and removal of items from both ends. We can utilize TypeScript array methods to achieve this functionality, using push() for the right end and unshift() for the left, while pop() and shift() remove elements from the right and left ends, respectively. // Create a deque and add items let deque: string[] = []; deque.push("Middle"); deque.push("Right end"); deque.unshift("Left end"); // Remove an item console.log(deque.pop()); // Expects "Right end" // Remove an item from the left console.log(deque.shift()); // Expects "Left end"

Practical Implementation of Deques

While arrays in TypeScript do not have a built-in rotation method, we can implement rotation manually using a loop and appropriate array methods. // Create a deque let deque: string[] = []; deque.push("Apple"); deque.push("Banana"); deque.push("Cherry"); // Rotate the deque to the right by 1 place for (let i = 0; i < 1; i++) {deque.unshift(deque.pop() as string);} console.log(deque); // Expects ["Cherry", "Apple", "Banana"] Here, the loop shifts all items to the right by one position.

TypeScript

// Create a deque and add items
let deque: string[] = [];
deque.push("Middle");
deque.push("Right end");
deque.unshift("Left end");

// Remove an item
console.log(deque.pop());  // Expects "Right end"

// Remove an item from the left
console.log(deque.shift()); // Expects "Left end"

TypeScript

// Create a deque
let deque: string[] = [];
deque.push("Apple");
deque.push("Banana");
deque.push("Cherry");

// Rotate the deque to the right by 1 place
for (let i = 0; i < 1; i++) {
    deque.unshift(deque.pop() as string);
}

console.log(deque);  // Expects ["Cherry", "Apple", "Banana"]