updated as per your sugession

Author: Vipullakum007

dsa-solutions/gfg-solutions/0004-fibbonacci-sum.md

@@ -14,13 +14,12 @@ This tutorial contains a complete walk-through of the Fibonacci Sum problem from
 
 ## Problem Description
 
-Given a positive number N, find the value of f0 + f1 + f2 + ... + fN where fi indicates the ith Fibonacci number. Note that f0 = 0, f1 = 1, f2 = 1, f3 = 2, f4 = 3, f5 = 5, and so on. Since the answer can be very large, return the result modulo 1000000007.
+Given a positive number N, find the value of $f0 + f1 + f2 + ... + fN$ where fi indicates the ith Fibonacci number. Note that $f0 = 0, f1 = 1, f2 = 1, f3 = 2, f4 = 3, f5 = 5,$ and so on. Since the answer can be very large, return the result modulo $1000000007$.
 
 ## Examples
 
-```
 **Example 1:**
-
+```
 Input:
 N = 3
 Output:
@@ -29,17 +28,14 @@ Explanation:
 0 + 1 + 1 + 2 = 4
 ```
 
-```
 **Example 2:**
-
-
+```
 Input:
 N = 4
 Output:
 7
 Explanation:
 0 + 1 + 1 + 2 + 3 = 7
-
 ```
 
 ## Your Task
@@ -267,3 +263,7 @@ By leveraging the properties of Fibonacci numbers and matrix multiplication, we
 - **GeeksforGeeks Problem:** [Geeks for Geeks Problem](https://www.geeksforgeeks.org/problems/fibonacci-sum/0)
 - **Solution Link:** [Fibonacci Sum on Geeks for Geeks](https://www.geeksforgeeks.org/problems/fibonacci-sum/0)
 - **Authors GeeksforGeeks Profile:** [Vipul](https://www.geeksforgeeks.org/user/lakumvipwjge/)
+
+```
+This structured tutorial provides a comprehensive solution to the Fibonacci Sum problem, making it easy for others to understand and implement in various programming languages.
+```

dsa-solutions/gfg-solutions/0005-next-happy-number.md

@@ -79,12 +79,12 @@ The numbers that, when you repeatedly sum the squares of their digits, eventuall
 Here are examples of how to determine if numbers less than 10 are happy numbers:
 
 - **Number 1:**
+
   $[1 ^ 2 = 1]$
   Since we have already reached 1, the process stops here. 1 is a happy number.
 
 - **Number 2:**
 
-```
   $[2^2 = 4]$
   $[4^2 = 16]$
   $[1^2 + 6^2 = 37]$
@@ -94,38 +94,41 @@ Here are examples of how to determine if numbers less than 10 are happy numbers:
   $[1^2 + 4^2 + 5^2 = 42]$
   $[4^2 + 2^2 = 20]$
   $[2^2 + 0^2 = 4]$
-
-  Since we have reached 4 again, the process will continue in an infinite loop. 2 is not a happy number.
-```
+  
+Since we have reached 4 again, the process will continue in an infinite loop. 2 is not a happy number.
 
 - **Number 3:**
+
   Similar to the above steps, 3 will also enter a loop and is not a happy number.
 
 - **Number 4:**
+
   Similar to the above steps, 4 will also enter a loop and is not a happy number.
 
 - **Number 5:**
+
   Similar to the above steps, 5 will also enter a loop and is not a happy number.
 
 - **Number 6:**
+
   Similar to the above steps, 6 will also enter a loop and is not a happy number.
 
 - **Number 7:**
 
-```
   $[7^2 = 49]$
   $[4^2 + 9^2 = 97]$
   $[9^2 + 7^2 = 130]$
   $[1^2 + 3^2 + 0^2 = 10]$
   $[1^2 + 0^2 = 1]$
 
   Since we have reached 1, the process stops here. 7 is a happy number.
-```
 
 - **Number 8:**
+
   Similar to the above steps, 8 will also enter a loop and is not a happy number.
 
 - **Number 9:**
+
   Similar to the above steps, 9 will also enter a loop and is not a happy number.
 
 Based on this analysis, the numbers less than 10 that result in 1 when you repeatedly sum the squares of their digits are: 1 and 7.