From 27a65b4a9e02bcc9d21e885e00545c0252e9bfc3 Mon Sep 17 00:00:00 2001
From: "Erskine Gamaliel L. Duenas"
 <91664149+laharl143@users.noreply.github.com>
Date: Fri, 21 Mar 2025 13:45:54 +0800
Subject: [PATCH] Fix: dequeue@DWO2-EPIUeKK5aQGiTuKc.md

-Fix: spelling
-Fix: pronunciation
---
 .../roadmaps/java/content/dequeue@DWO2-EPIUeKK5aQGiTuKc.md    | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/src/data/roadmaps/java/content/dequeue@DWO2-EPIUeKK5aQGiTuKc.md b/src/data/roadmaps/java/content/dequeue@DWO2-EPIUeKK5aQGiTuKc.md
index 3dfb3b99f..00cef4d27 100644
--- a/src/data/roadmaps/java/content/dequeue@DWO2-EPIUeKK5aQGiTuKc.md
+++ b/src/data/roadmaps/java/content/dequeue@DWO2-EPIUeKK5aQGiTuKc.md
@@ -1,6 +1,6 @@
-# Dequeue
+# Deque
 
-A Dequeue (pronounced "dee-queue") is a double-ended queue, a data structure that allows you to add and remove elements from both the front (head) and the back (tail) of the queue. Unlike a regular queue (FIFO - First-In, First-Out), a dequeue provides flexibility for both FIFO and LIFO (Last-In, First-Out) operations. This makes it useful for implementing various algorithms and data management tasks where elements need to be accessed or modified from either end.
+A Deque (pronounced "deck") is a double-ended queue, a data structure that allows you to add and remove elements from both the front (head) and the back (tail) of the queue. Unlike a regular queue (FIFO - First-In, First-Out), a deque provides flexibility for both FIFO and LIFO (Last-In, First-Out) operations. This makes it useful for implementing various algorithms and data management tasks where elements need to be accessed or modified from either end.
 
 Visit the following resources to learn more: