Peek Front Element of Queue in DSA Go - Time & Space Complexity

Time Complexity: Peek Front Element of Queue

O(1)

Understanding Time Complexity

We want to understand how long it takes to look at the first item in a queue without removing it.

How does the time needed change as the queue grows bigger?

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

// Peek returns the front element of the queue without removing it
func (q *Queue) Peek() (int, bool) {
    if len(q.items) == 0 {
        return 0, false // queue empty
    }
    return q.items[0], true
}
    

This code checks if the queue is empty and then returns the first element if it exists.

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

• Primary operation: Accessing the first element of the queue array.
• How many times: Exactly once per peek call, no loops or recursion involved.

How Execution Grows With Input

Looking at the front element takes the same amount of time no matter how big the queue is.

Input Size (n)	Approx. Operations
10	1
100	1
1000	1

Pattern observation: The time stays constant as the queue grows.

Final Time Complexity

Time Complexity: O(1)

This means peeking at the front element takes the same short time no matter how many items are in the queue.

Common Mistake

[X] Wrong: "Peeking takes longer if the queue is bigger because it has to look through all items."

[OK] Correct: The peek only looks at the first item directly, so it does not check the rest of the queue.

Interview Connect

Knowing that peek is a quick, constant-time operation helps you explain efficient queue usage in real programs.

Self-Check

"What if the queue was implemented using a linked list instead of an array? How would the time complexity of peek change?"

Practice

1. What does the Peek operation do in a queue?

easy

A. Returns the front element without removing it

B. Removes the front element from the queue

C. Adds an element to the back of the queue

D. Checks if the queue is empty

Solution

1. Step 1: Understand the queue operations

   A queue supports adding elements at the back and removing from the front.

2. Step 2: Define Peek operation

   Peek returns the front element without removing it, unlike dequeue which removes it.

3. Final Answer:

   Returns the front element without removing it -> Option A

4. Quick Check:

   Peek = front element without removal [OK]

Hint: Peek shows front without removal, unlike dequeue [OK]

Common Mistakes:

• Confusing peek with dequeue
• Thinking peek adds elements
• Assuming peek checks emptiness

2. Which of the following is the correct Go syntax to peek the front element of a queue implemented as a slice named queue?

easy

A. front := queue[len(queue)-1]

B. front := queue[len(queue)]

C. front := queue[0]

D. front := queue.pop()

Solution

1. Step 1: Understand Go slice indexing

   Go slices are zero-indexed, so the first element is at index 0.

2. Step 2: Identify front element access

   The front element of a queue is the first element, so queue[0] gives it.

3. Final Answer:

   front := queue[0] -> Option C

4. Quick Check:

   First element index = 0 [OK]

Hint: Front element is always at index 0 in slice queue [OK]

Common Mistakes:

• Using len(queue) which is out of range
• Using last element instead of first
• Using pop() which is not a Go slice method

3. What will be the output of the following Go code snippet?

queue := []int{10, 20, 30}
front := queue[0]
fmt.Println(front)

medium

A. runtime error

B. 10

C. 30

D. 20

Solution

1. Step 1: Initialize queue slice

   The queue slice contains elements [10, 20, 30].

2. Step 2: Access front element

   front := queue[0] assigns 10 to front.

3. Step 3: Print front

   fmt.Println(front) prints 10.

4. Final Answer:

   10 -> Option B

5. Quick Check:

   queue[0] = 10 [OK]

Hint: queue[0] gives first element value [OK]

Common Mistakes:

• Printing queue[1] instead of queue[0]
• Expecting last element output
• Thinking it causes runtime error

4. Identify the error in this Go code that tries to peek the front element of a queue:

var queue []int
front := queue[0]
fmt.Println(front)

medium

A. No error, prints 0

B. Prints nil

C. Compile-time syntax error

D. Runtime panic: index out of range

Solution

1. Step 1: Check queue initialization

   queue is declared but not initialized, so length is 0.

2. Step 2: Accessing queue[0]

   Accessing queue[0] causes runtime panic because slice is empty.

3. Final Answer:

   Runtime panic: index out of range -> Option D

4. Quick Check:

   Empty slice access causes panic [OK]

Hint: Empty slice access causes runtime panic [OK]

Common Mistakes:

• Assuming default zero value is returned
• Expecting compile-time error
• Thinking it prints nil

5. Given a queue implemented as a slice queue := []int{5, 10, 15}, write the correct Go code snippet to safely peek the front element and handle the empty queue case by printing "Empty" if no elements exist.

hard

A. if len(queue) > 0 {
fmt.Println(queue[0])
} else {
fmt.Println("Empty")
}

B. fmt.Println(queue[0])

C. if queue != nil {
fmt.Println(queue[0])
} else {
fmt.Println("Empty")
}

D. if len(queue) == 0 {
fmt.Println(queue[0])
} else {
fmt.Println("Empty")
}

Solution

1. Step 1: Check queue length before access

   Use len(queue) > 0 to ensure queue has elements.

2. Step 2: Print front or "Empty"

   If queue has elements, print queue[0]; else print "Empty".

3. Final Answer:

   if len(queue) > 0 { fmt.Println(queue[0]) } else { fmt.Println("Empty") } -> Option A

4. Quick Check:

   Check length before access to avoid panic [OK]

Hint: Always check length before peeking front [OK]

Common Mistakes:

• Not checking length before access
• Checking nil instead of length
• Reversing if-else logic