Merge pull request #36 from AdityaInnovates/TEST

AdityaInnovates · web-flow · commit a5f79861a8d3 · 2025-09-15T13:35:18.000+05:30
Test
diff --git a/blogsList.json b/blogsList.json
@@ -14,7 +14,7 @@
   {
     "id": "f1b3w4cbw43sa",
     "image": "https://miro.medium.com/v2/resize:fit:1400/1*TnkzeYKY653YXS9jZ6oapg.png",
-    "title": "Maximum Element in an Array",
+    "title": "Maximum Element in an Array ",
     "description": "The Maximum Element algorithm is a simple way to find the largest number in an array. Starting with an initial assumption of the maximum element, we iterate through each element in the array, updating our assumption whenever we find a larger element. This method works well for both sorted and unsorted arrays."
   },
   {

Original file line number	Diff line number	Diff line change
`@@ -14,7 +14,7 @@`
`14`	`14`	`{`
`15`	`15`	`"id": "f1b3w4cbw43sa",`
`16`	`16`	`"image": "https://miro.medium.com/v2/resize:fit:1400/1*TnkzeYKY653YXS9jZ6oapg.png",`
`17`		`- "title": "Maximum Element in an Array",`
	`17`	`+ "title": "Maximum Element in an Array ",`
`18`	`18`	`"description": "The Maximum Element algorithm is a simple way to find the largest number in an array. Starting with an initial assumption of the maximum element, we iterate through each element in the array, updating our assumption whenever we find a larger element. This method works well for both sorted and unsorted arrays."`
`19`	`19`	`},`
`20`	`20`	`{`