diff --git a/curriculum/challenges/english/blocks/lab-implement-a-queue/69aaafeaa4037197c75587cd.md b/curriculum/challenges/english/blocks/lab-implement-a-queue/69aaafeaa4037197c75587cd.md
index 9e45e9e4159..424425c26f3 100644
--- a/curriculum/challenges/english/blocks/lab-implement-a-queue/69aaafeaa4037197c75587cd.md
+++ b/curriculum/challenges/english/blocks/lab-implement-a-queue/69aaafeaa4037197c75587cd.md
@@ -13,12 +13,14 @@ In this lab, you will implement a queue data structure using functions. A queue
 
 **User Stories:**
 
-1. You should have a `enqueue` function that adds an element to the back of the queue.
+1. You should have an `enqueue` function that adds an element to the back of the queue.
 1. You should have a `dequeue` function that removes and returns the front element of the queue.
 1. You should have a `front` function that returns the front element of the queue without removing it.
 1. You should have a `size` function that returns the number of elements in the queue.
 1. You should have an `isEmpty` function that returns `true` if the queue is empty and `false` otherwise.
 
+**Note:** Most tests depend on the `enqueue` function. Implement that one first, as tests for `dequeue`, `front`, `size`, and `isEmpty` require adding elements to the queue.
+
 # --hints--
 
 You should have an `enqueue` function.