Update README.md

JawadSher · web-flow · commit 74e8bf833b41 · 2024-11-16T19:21:52.000+05:00
diff --git a/16 - Queue Data Structure Problems/01 - Linear Queue Problems/README.md b/16 - Queue Data Structure Problems/01 - Linear Queue Problems/README.md
@@ -1,4 +1,4 @@
-<h1 align='center'>LINEAR - QUEUE - PROBLEMS</h1>
+<h1 align='center'>LINEAR - QUEUE - DATA STRUCTURE - PROBLEMS</h1>
 
 <p align='center'>A <b>Linear Queue</b> is a fundamental data structure in computer science used to store and manage a collection of elements in a specific order. It operates on a **First In, First Out (FIFO)** principle, meaning the first element added to the queue is the first one to be removed. 
 </p>

Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-<h1 align='center'>LINEAR - QUEUE - PROBLEMS</h1>`
	`1`	`+<h1 align='center'>LINEAR - QUEUE - DATA STRUCTURE - PROBLEMS</h1>`
`2`	`2`
`3`	`3`	`<p align='center'>A <b>Linear Queue</b> is a fundamental data structure in computer science used to store and manage a collection of elements in a specific order. It operates on a First In, First Out (FIFO) principle, meaning the first element added to the queue is the first one to be removed.`
`4`	`4`	`</p>`