Double Ended Queue Deque in DSA Rust - Cheat Sheet & Quick Revision

Recall & Review

beginner

What is a Double Ended Queue (Deque)?

A Double Ended Queue, or Deque, is a data structure where elements can be added or removed from both the front and the back ends.

beginner

Name two common operations supported by a Deque.

Two common operations are:
1. push_front: Add an element to the front.
2. pop_back: Remove an element from the back.

beginner

In Rust, which standard library type provides a Deque implementation?

Rust provides the VecDeque type in the std::collections module for a double ended queue.

intermediate

Why is a Deque more flexible than a regular queue?

Because a Deque allows insertion and removal from both ends, it can act as both a queue (FIFO) and a stack (LIFO), making it more flexible.

intermediate

What is the time complexity of adding or removing elements at either end of a VecDeque in Rust?

Adding or removing elements at either end of a VecDeque is generally O(1), meaning it takes constant time.

Which operation is NOT typically supported by a Deque?

A Add element at front

B Add element in the middle

C Remove element from back

D Remove element from front

Deques allow adding or removing elements only at the front or back, not in the middle.

In Rust, which module contains the VecDeque type?

A std::option

B std::vec

C std::collections

D std::io

VecDeque is found in the std::collections module.

What is the main advantage of using a Deque over a simple queue?

A Supports insertion/removal at both ends

B Faster sorting

C Uses less memory

D Only allows insertion at back

Deques allow adding and removing elements at both front and back, unlike simple queues.

What is the time complexity of popping an element from the front of a VecDeque?

A O(n log n)

B O(log n)

C O(n)

D O(1)

Popping from the front of a VecDeque is a constant time operation, O(1).

Which of these is a valid use case for a Deque?

A Implementing undo functionality

B Sorting large arrays

C Storing key-value pairs

D Performing binary search

Deques can be used to implement undo stacks because they allow adding/removing from both ends.

Explain what a Double Ended Queue (Deque) is and how it differs from a regular queue.

Think about where you can add or remove items.

Describe how Rust's VecDeque works and why it is efficient for double ended queue operations.

Consider how VecDeque manages its storage internally.

Practice

1. What is a deque in data structures?

easy

A. A double-ended queue allowing insertion and removal from both ends

B. A queue that only allows insertion at the front

C. A stack that only allows removal from the top

D. A list that only supports random access

Solution

1. Step 1: Understand the deque concept

   A deque is a data structure where elements can be added or removed from both the front and the back.

2. Step 2: Compare options with deque definition

   Only double-ended queue allowing insertion and removal from both ends correctly describes this behavior; others describe different structures.

3. Final Answer:

   A double-ended queue allowing insertion and removal from both ends -> Option A

4. Quick Check:

   Deque = double-ended queue [OK]

Hint: Deque means double-ended queue, both ends usable [OK]

Common Mistakes:

• Confusing deque with stack or regular queue
• Thinking deque only allows insertion at one end
• Assuming deque is a fixed-size array

2. Which of the following is the correct way to create an empty VecDeque in Rust?

easy

A. let dq = VecDeque::empty();

B. let dq = VecDeque();

C. let dq = new VecDeque();

D. let dq = VecDeque::new();

Solution

1. Step 1: Recall Rust VecDeque creation syntax

   In Rust, the standard way to create an empty VecDeque is by calling VecDeque::new().

2. Step 2: Check each option for Rust syntax correctness

   let dq = VecDeque::new(); uses correct Rust syntax. The other options are invalid Rust syntax for VecDeque creation.

3. Final Answer:

   let dq = VecDeque::new(); -> Option D

4. Quick Check:

   VecDeque::new() creates empty deque [OK]

Hint: Use VecDeque::new() to create empty deque in Rust [OK]

Common Mistakes:

• Using constructor syntax like VecDeque() which is invalid in Rust
• Trying to call new as a method without ::
• Using non-existent empty() method

3. What will be the output of the following Rust code?

use std::collections::VecDeque;

fn main() {
    let mut dq = VecDeque::new();
    dq.push_back(10);
    dq.push_front(20);
    dq.push_back(30);
    dq.pop_front();
    println!("{:?}", dq);
}

medium

A. [10, 30]

B. [20, 10, 30]

C. [30, 10]

D. [10, 20, 30]

Solution

1. Step 1: Trace deque operations step-by-step

   Initially empty deque: [] - push_back(10): [10] - push_front(20): [20, 10] - push_back(30): [20, 10, 30] - pop_front(): removes 20, resulting in [10, 30]

2. Step 2: Confirm final deque state

   After all operations, the deque contains [10, 30].

3. Final Answer:

   [10, 30] -> Option A

4. Quick Check:

   After pop_front, deque = [10, 30] [OK]

Hint: Track push/pop order carefully front and back [OK]

Common Mistakes:

• Forgetting pop_front removes front element
• Mixing order of push_front and push_back
• Assuming pop_front removes back element

4. Identify the error in the following Rust code using VecDeque:

use std::collections::VecDeque;

fn main() {
    let mut dq = VecDeque::new();
    dq.push_front(5);
    dq.push_back(10);
    let x = dq.pop_back();
    println!("{}", x);
}

medium

A. pop_back() does not return a value

B. Cannot print Option<i32> directly with {}

C. VecDeque does not have push_front method

D. dq must be immutable to pop elements

Solution

1. Step 1: Understand pop_back return type

   pop_back() returns an Option containing the popped value or None if empty.

2. Step 2: Check println! usage

   Using {} tries to print the Option<i32> directly, which causes a type mismatch error. {:?} or unwrap() is needed.

3. Final Answer:

   Cannot print Option<i32> directly with {} -> Option B

4. Quick Check:

   Option<i32> needs {:?} or unwrap() to print [OK]

Hint: Use {:?} or unwrap() to print Option values [OK]

Common Mistakes:

• Trying to print Option with {} instead of {:?}
• Assuming pop_back returns value directly, not Option
• Thinking VecDeque lacks push_front method

5. You want to implement a sliding window maximum using a VecDeque in Rust. Which approach correctly maintains the deque to always have the maximum at the front while sliding the window?

hard

A. Remove elements from front smaller than new element before pushing it to front

B. Always push new element to front without removing any elements

C. Remove elements from back smaller than new element before pushing it to back

D. Remove elements from back larger than new element before pushing it to back

Solution

1. Step 1: Understand sliding window max logic with deque

   To keep max at front, remove all smaller elements from back before adding new element at back.

2. Step 2: Analyze options for correct deque maintenance

   Remove elements from back smaller than new element before pushing it to back correctly describes removing smaller elements from back before pushing new element to back. Others do not maintain max at front properly.

3. Final Answer:

   Remove elements from back smaller than new element before pushing it to back -> Option C

4. Quick Check:

   Sliding window max uses back removals of smaller elements [OK]

Hint: Pop smaller from back before push_back new max candidate [OK]

Common Mistakes:

• Removing from front instead of back
• Pushing new elements to front incorrectly
• Removing larger elements instead of smaller