Double Ended Queue Deque in DSA Rust

Mental Model

A deque lets you add or remove items from both the front and the back easily.

Analogy: Imagine a line of people where you can join or leave from either the front or the end without waiting for others to move.

front -> [1] -> [2] -> [3] -> back

Dry Run Walkthrough

Input: start with empty deque, add 1 at back, add 2 at front, add 3 at back, remove from front

Goal: show how items are added and removed from both ends

Step 1: add 1 at back

front -> [1] -> back

Why: adding first item sets both front and back to 1

Step 2: add 2 at front

front -> [2] -> [1] -> back

Why: adding at front puts 2 before 1

Step 3: add 3 at back

front -> [2] -> [1] -> [3] -> back

Why: adding at back puts 3 after 1

Step 4: remove from front

front -> [1] -> [3] -> back

Why: removing front removes 2, next item becomes new front

Result:

front -> [1] -> [3] -> back

Annotated Code

DSA Rust

use std::collections::VecDeque;

fn main() {
    let mut deque: VecDeque<i32> = VecDeque::new();

    // Step 1: add 1 at back
    deque.push_back(1);
    // Step 2: add 2 at front
    deque.push_front(2);
    // Step 3: add 3 at back
    deque.push_back(3);
    // Step 4: remove from front
    deque.pop_front();

    // Print final deque
    print_deque(&deque);
}

fn print_deque(deque: &VecDeque<i32>) {
    let mut result = String::new();
    result.push_str("front -> ");
    for &item in deque {
        result.push_str(&format!("[{}] -> ", item));
    }
    result.push_str("back");
    println!("{}", result);
}

deque.push_back(1);

add first item at back, sets front and back

deque.push_front(2);

add item at front, shifts existing items right

deque.push_back(3);

add item at back, appends after last

deque.pop_front();

remove item from front, front moves to next

Output

front -> [1] -> [3] -> back

Complexity Analysis

Time: O(1) for each add or remove operation because deque uses a double-ended structure allowing fast access at both ends

Space: O(n) because it stores all n elements in memory

vs Alternative: Compared to a normal queue or stack, deque allows operations at both ends in constant time instead of just one end

Edge Cases

empty deque when removing

pop_front or pop_back returns None safely without error

DSA Rust

deque.pop_front();

single element deque

removing front or back empties the deque correctly

DSA Rust

deque.pop_front();

When to Use This Pattern

When a problem needs adding or removing items from both ends quickly, use a deque because it supports fast operations at front and back.

Common Mistakes

Mistake: Trying to add or remove from the middle of the deque directly
Fix: Remember deque only supports fast operations at front and back, not in the middle

Mistake: Using a normal vector and shifting elements for front operations
Fix: Use VecDeque which is optimized for front and back operations without shifting

Summary

A deque lets you add or remove items from both front and back efficiently.

Use it when you need flexible queue behavior from both ends.

The key is it supports constant time operations at both ends without shifting.

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