Dequeue Operation in DSA Rust - Cheat Sheet & Quick Revision

Recall & Review

beginner

What is a dequeue (double-ended queue)?

A dequeue is a data structure where elements can be added or removed from both the front and the back, like a line where you can enter or leave from either end.

beginner

What are the two main operations in a dequeue?

The two main operations are enqueue (adding elements) and dequeue (removing elements), both possible at the front or back ends.

intermediate

In Rust, which standard library type can be used to implement a dequeue?

Rust's standard library provides VecDeque, a growable ring buffer that efficiently supports adding and removing elements from both ends.

beginner

What happens when you dequeue from an empty dequeue?

If you try to remove an element from an empty dequeue, the operation returns None (no element), indicating the dequeue is empty.

beginner

Explain the difference between pop_front() and pop_back() in a dequeue.

pop_front() removes and returns the element at the front of the dequeue, while pop_back() removes and returns the element at the back.

Which Rust type is best suited for implementing a dequeue?

A VecDeque

B Vec

C LinkedList

D HashMap

VecDeque is designed for efficient adding/removing at both ends, unlike Vec or HashMap.

What does pop_front() return if the dequeue is empty?

A None

B Some(element)

C Panic error

D Zero

pop_front() returns None when the dequeue is empty, indicating no element to remove.

Which operation removes an element from the back of a dequeue?

A push_front()

B pop_front()

C push_back()

D pop_back()

pop_back() removes and returns the element at the back of the dequeue.

Can you add elements to both ends of a dequeue?

A No, only front

B Yes

C No, only back

D No, neither end

A dequeue supports adding elements at both front and back ends.

What is the time complexity of pop_front() in VecDeque?

A O(log n)

B O(n)

C O(1)

D O(n^2)

pop_front() in VecDeque runs in constant time O(1) due to its ring buffer design.

Describe how a dequeue allows adding and removing elements from both ends and why this is useful.

Think of a line where you can enter or leave from either side.

Explain how Rust's VecDeque supports dequeue operations efficiently.

Consider how a circular buffer helps avoid shifting elements.

Practice

1. What does the pop_front() operation do in a dequeue?

easy

A. Removes and returns the element at the front of the dequeue

B. Removes and returns the element at the back of the dequeue

C. Adds an element to the front of the dequeue

D. Adds an element to the back of the dequeue

Solution

1. Step 1: Understand pop_front() operation

   The pop_front() removes the first element from the front of the dequeue.

2. Step 2: Compare with other operations

   Unlike pop_back() which removes from the back, pop_front() targets the front element.

3. Final Answer:

   Removes and returns the element at the front of the dequeue -> Option A

4. Quick Check:

   pop_front() = remove front element [OK]

Hint: pop_front() always removes from the front [OK]

Common Mistakes:

• Confusing pop_front() with pop_back()
• Thinking pop_front() adds elements
• Mixing push and pop operations

2. Which of the following is the correct Rust syntax to remove an element from the back of a VecDeque named dq?

easy

A. dq.pop_front();

B. dq.pop_back();

C. dq.remove_back();

D. dq.pop();

Solution

1. Step 1: Identify VecDeque method for back removal

   The correct method to remove from the back is pop_back().

2. Step 2: Check other options

   pop_front() removes from front, remove_back() and pop() are invalid methods for VecDeque.

3. Final Answer:

   dq.pop_back(); -> Option B

4. Quick Check:

   pop_back() removes back element [OK]

Hint: Use pop_back() to remove from back in VecDeque [OK]

Common Mistakes:

• Using pop() which is for Vec, not VecDeque
• Using remove_back() which does not exist
• Confusing pop_front() with pop_back()

3. What is the output of the following Rust code?

use std::collections::VecDeque;

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

medium

A. [5, 10, 20]

B. [1, 10, 20]

C. [10, 20, 1]

D. [1, 5, 10]

Solution

1. Step 1: Trace push_back and push_front calls

   After push_back(10) and push_back(20), dq = [10, 20]. Then push_front(5) makes dq = [5, 10, 20].

2. Step 2: Apply pop_back and push_front

   pop_back() removes 20, dq = [5, 10]. Then push_front(1) makes dq = [1, 5, 10].

3. Final Answer:

   [1, 5, 10] -> Option D

4. Quick Check:

   Operations result in [1, 5, 10] [OK]

Hint: Track each operation step-by-step on the deque [OK]

Common Mistakes:

• Forgetting pop_back removes last element
• Mixing order of push_front and push_back
• Misreading the final print format

4. Identify the error in this Rust code that tries to remove an element from the front of a VecDeque named dq:

use std::collections::VecDeque;

fn main() {
    let mut dq = VecDeque::new();
    dq.push_back(1);
    dq.push_back(2);
    let front = dq.pop();
    println!("{:?}", front);
}

medium

A. VecDeque has no method named pop()

B. pop() removes from back, not front

C. dq is not mutable

D. push_back() is used incorrectly

Solution

1. Step 1: Check VecDeque methods

   VecDeque does not have a method named pop(). It uses pop_front() or pop_back().

2. Step 2: Identify the error cause

   Calling dq.pop() causes a compile-time error because the method does not exist.

3. Final Answer:

   VecDeque has no method named pop() -> Option A

4. Quick Check:

   pop() method missing in VecDeque [OK]

Hint: Use pop_front() or pop_back() for VecDeque removals [OK]

Common Mistakes:

• Using pop() from Vec on VecDeque
• Ignoring compiler error messages
• Assuming pop() removes front element

5. Given a VecDeque with elements [3, 6, 9, 12], which sequence of operations will result in the dequeue [1, 3, 6]?

hard

A. dq.pop_back(); dq.pop_front(); dq.push_front(1);

B. dq.pop_front(); dq.pop_back(); dq.push_front(1);

C. dq.pop_back(); dq.pop_back(); dq.push_front(1);

D. dq.pop_front(); dq.pop_front(); dq.push_back(1);

Solution

1. Step 1: Start with dq = [3, 6, 9, 12]

   Initial dequeue has elements 3, 6, 9, 12 in order.

2. Step 2: Apply operations in dq.pop_back(); dq.pop_back(); dq.push_front(1);

   First pop_back() removes 12, dq = [3, 6, 9]. Second pop_back() removes 9, dq = [3, 6]. Then push_front(1) adds 1 at front, dq = [1, 3, 6].

3. Final Answer:

   dq.pop_back(); dq.pop_back(); dq.push_front(1); -> Option C

4. Quick Check:

   Operations produce [1, 3, 6] [OK]

Hint: Remove from back twice, then add 1 at front [OK]

Common Mistakes:

• Removing from front instead of back
• Adding 1 at back instead of front
• Wrong operation order