Update README.md

JawadSher · web-flow · commit 564b5dd3159a · 2024-11-16T19:21:28.000+05:00
diff --git a/16 - Queue Data Structure Problems/03 - (Deque) Doubly Ended Queue Problems/README.md b/16 - Queue Data Structure Problems/03 - (Deque) Doubly Ended Queue Problems/README.md
@@ -1,4 +1,4 @@
-<h1 align='center'>CIRCULAR - DEQUE - DATA STRUCTURE - PROBLEMS</h1>
+<h1 align='center'>DEQUE - DATA STRUCTURE - PROBLEMS</h1>
 
 <p align='center'>A <b>Circular Deque</b> is an advanced version of the double-ended queue (Deque) that behaves like a circular buffer. Unlike a linear deque, which allows insertion and deletion of elements from both ends (front and rear), the circular deque links the last position to the first position, creating a loop. This allows for more efficient use of space and ensures that the queue can be used in continuous cycles without the risk of unused memory.</p>
 

Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-<h1 align='center'>CIRCULAR - DEQUE - DATA STRUCTURE - PROBLEMS</h1>`
	`1`	`+<h1 align='center'>DEQUE - DATA STRUCTURE - PROBLEMS</h1>`
`2`	`2`
`3`	`3`	`<p align='center'>A <b>Circular Deque</b> is an advanced version of the double-ended queue (Deque) that behaves like a circular buffer. Unlike a linear deque, which allows insertion and deletion of elements from both ends (front and rear), the circular deque links the last position to the first position, creating a loop. This allows for more efficient use of space and ensures that the queue can be used in continuous cycles without the risk of unused memory.</p>`
`4`	`4`