|
1 | 1 | [ |
2 | 2 | { |
3 | | - "id": "7654321", |
| 3 | + "id": "7654321a", |
4 | 4 | "image": "public/blog1.jpeg", |
5 | 5 | "title": "Captain and List Operations", |
6 | 6 | "description": "Once upon a time in the Kingdom of Codehaven, there lived a legendary adventurer known as Captain Python. Captain Python was renowned for his mastery of Pythonic arts—skills that helped him navigate through the most difficult programming challenges." |
7 | 7 | }, |
8 | 8 | { |
9 | | - "id": "86vtgil6uicfd5", |
| 9 | + "id": "186vtgil6uaicfd5", |
10 | 10 | "image": "https://media.geeksforgeeks.org/wp-content/uploads/20240506105158/Linear-Search-algorithm-banner-(1).webp", |
11 | 11 | "title": "Linear Search Algorithm", |
12 | 12 | "description": "The Linear Search algorithm is one of the most straightforward search techniques. In a linear search, we sequentially check each element of a list or array until we find the target value or reach the end of the list. Although simple, this algorithm is effective for small datasets or unsorted data, as it does not require pre-sorting." |
13 | 13 | }, |
14 | 14 | { |
15 | | - "id": "fb3w4cbw43sa", |
| 15 | + "id": "f1b3w4cbw43sa", |
16 | 16 | "image": "https://miro.medium.com/v2/resize:fit:1400/1*TnkzeYKY653YXS9jZ6oapg.png", |
17 | 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 | { |
21 | | - "id": "dfrt54fegr54t", |
| 21 | + "id": "1dfrt54fegr54t", |
22 | 22 | "image": "https://favtutor.com/resources/images/uploads/Python_Count_occurences_of_element_in_list.png", |
23 | 23 | "title": "Count of Element in an Array", |
24 | 24 | "description": "The Counting Occurrences algorithm is a simple way to find how many times a specific element appears in an array. It works by iterating through each element in the array and counting each match to the target value. This approach is useful in both sorted and unsorted arrays." |
|
79 | 79 | { |
80 | 80 | "id": "blog_id_123", |
81 | 81 | "image": "https://www.boardinfinity.com/blog/content/images/2023/05/Generator-in-Python.png", |
82 | | - "title": "Understanding Generators in Python", |
| 82 | + "title": "Understanding Generators in Python ", |
83 | 83 | "description": "Memory-efficient iterators for large datasets." |
84 | 84 | },{ |
85 | 85 | "id": "Adjacency_list_blog", |
|
90 | 90 | { |
91 | 91 | "id": "Effective_Coding_Tips_Blog", |
92 | 92 | "image": "https://www.freecodecamp.org/news/content/images/size/w2000/2023/05/pexels-ken-tomita-389819.jpg", |
93 | | - "title": "Tips for writing clean code ", |
| 93 | + "title": "Tips for writing clean code", |
94 | 94 | "description": "Learn essential tips for writing efficient and maintainable code" |
95 | 95 | } |
96 | 96 | ] |
0 commit comments