diff --git a/dsa-solutions/lc-solutions/0400-0499/0493-reverse-pairs.md b/dsa-solutions/lc-solutions/0400-0499/0493-reverse-pairs.md
index 259a6e4c1..0eba99b78 100644
--- a/dsa-solutions/lc-solutions/0400-0499/0493-reverse-pairs.md
+++ b/dsa-solutions/lc-solutions/0400-0499/0493-reverse-pairs.md
@@ -1,323 +1,323 @@
----
-id: reverse-pairs
-title: Reverse Pairs
-sidebar_label: 493-Reverse-Pairs
-tags:
-  - Array
-  - Binary Search
-  - Divide and conquer
-  - Binary Indexed Tree
-  - Segment Tree
-  - Merge Sort
-  - Ordered Set
-description: The problem is to reverse the pairs.
-sidebar_position: 2667
----
-
-## Problem Statement 
-
-### Problem Description
-
-Given an integer array `nums`, return the number of reverse pairs in the array.
-
-A reverse pair is a pair `(i, j)` where:
-
-`0 <= i < j < nums.length` and
-`nums[i] > 2 * nums[j]`.
-
-### Examples
-
-**Example 1:**
-
-```
-Input: nums = [1,3,2,3,1]
-Output: 2
-Explanation: The reverse pairs are:
-(1, 4) --> nums[1] = 3, nums[4] = 1, 3 > 2 * 1
-(3, 4) --> nums[3] = 3, nums[4] = 1, 3 > 2 * 1
-```
-
-**Example 2:**
-
-```
-Input: nums = [2,4,3,5,1]
-Output: 3
-Explanation: The reverse pairs are:
-(1, 4) --> nums[1] = 4, nums[4] = 1, 4 > 2 * 1
-(2, 4) --> nums[2] = 3, nums[4] = 1, 3 > 2 * 1
-(3, 4) --> nums[3] = 5, nums[4] = 1, 5 > 2 * 1
-```
-
-### Constraints
-
-- `1 <= nums.length <= 5 * 10^4`
-
-## Solution of Given Problem
-
-### Intuition and Approach
-
-The intuition behind this solution is to use a modified Merge Sort algorithm to count the number of reverse pairs in the array.
-
-
-### Approaches
-
-- Divide the array into smaller subarrays until each subarray has only one element.
-- Merge the subarrays back together, counting the number of reverse pairs between each pair of subarrays.
-- The merge step is done in a way that ensures the count of reverse pairs is accurate.
-
-
-#### Codes in Different Languages
-
-<Tabs>
-  <TabItem value="JavaScript" label="JavaScript" default>
-  <SolutionAuthor name="@Ishitamukherjee2004"/>
-   ```javascript
-    function mergeSortedArrays(nums, left, mid, right, temp) {
-  let i = left, j = mid + 1, k = 0;
-  while (i <= mid && j <= right) {
-    if (nums[i] <= nums[j]) temp[k++] = nums[i++];
-    else temp[k++] = nums[j++];
-  }
-  while (i <= mid) temp[k++] = nums[i++];
-  while (j <= right) temp[k++] = nums[j++];
-}
-
-function merge(nums, left, mid, right) {
-  let count = 0;
-  let j = mid + 1;
-  for (let i = left; i <= mid; i++) {
-    while (j <= right && nums[i] > 2 * nums[j]) j++;
-    count += j - mid - 1;
-  }
-  let temp = new Array(right - left + 1);
-  mergeSortedArrays(nums, left, mid, right, temp);
-  for (let i = left; i <= right; i++) nums[i] = temp[i - left];
-  return count;
-}
-function mergeSort(nums, left, right) {
-  if (left >= right) return 0;
-  let mid = left + (right - left) / 2;
-  let count = mergeSort(nums, left, mid) + mergeSort(nums, mid + 1, right);
-  count += merge(nums, left, mid, right);
-  return count;
-}
-
-class Solution {
-  reversePairs(nums) {
-    return mergeSort(nums, 0, nums.length - 1);
-  }
-}
-
-
-    ```
-
-  </TabItem>
-  <TabItem value="TypeScript" label="TypeScript">
-  <SolutionAuthor name="@Ishitamukherjee2004"/> 
-   ```typescript
-    function mergeSortedArrays(nums: number[], left: number, mid: number, right: number, temp: number[]) {
-  let i = left, j = mid + 1, k = 0;
-  while (i <= mid && j <= right) {
-    if (nums[i] <= nums[j]) temp[k++] = nums[i++];
-    else temp[k++] = nums[j++];
-  }
-  while (i <= mid) temp[k++] = nums[i++];
-  while (j <= right) temp[k++] = nums[j++];
-}
-
-function merge(nums: number[], left: number, mid: number, right: number) {
-  let count = 0;
-  let j = mid + 1;
-  for (let i = left; i <= mid; i++) {
-    while (j <= right && nums[i] > 2 * nums[j]) j++;
-    count += j - mid - 1;
-  }
-  let temp = new Array(right - left + 1);
-  mergeSortedArrays(nums, left, mid, right, temp);
-  for (let i = left; i <= right; i++) nums[i] = temp[i - left];
-  return count;
-}
-function mergeSort(nums: number[], left: number, right: number) {
-  if (left >= right) return 0;
-  let mid = left + (right - left) / 2;
-  let count = mergeSort(nums, left, mid) + mergeSort(nums, mid + 1, right);
-  count += merge(nums, left, mid, right);
-  return count;
-}
-
-class Solution {
-  reversePairs(nums: number[]) {
-    return mergeSort(nums, 0, nums.length - 1);
-  }
-}
-
-    ```
-
-  </TabItem>
-  <TabItem value="Python" label="Python"> 
-  <SolutionAuthor name="@Ishitamukherjee2004"/>
-   ```python
-    def merge_sorted_arrays(nums, left, mid, right, temp):
-    i, j, k = left, mid + 1, 0
-    while i <= mid and j <= right:
-        if nums[i] <= nums[j]:
-            temp[k] = nums[i]
-            i += 1
-        else:
-            temp[k] = nums[j]
-            j += 1
-        k += 1
-    while i <= mid:
-        temp[k] = nums[i]
-        i += 1
-        k += 1
-    while j <= right:
-        temp[k] = nums[j]
-        j += 1
-        k += 1
-
-def merge(nums, left, mid, right):
-    count = 0
-    j = mid + 1
-    for i in range(left, mid + 1):
-        while j <= right and nums[i] > 2 * nums[j]:
-            j += 1
-        count += j - mid - 1
-    temp = [0] * (right - left + 1)
-    merge_sorted_arrays(nums, left, mid, right, temp)
-    for i in range(left, right + 1):
-        nums[i] = temp[i - left]
-    return count
-
-def merge_sort(nums, left, right):
-    if left >= right:
-        return 0
-    mid = left + (right - left) // 2
-    count = merge_sort(nums, left, mid) + merge_sort(nums, mid + 1, right)
-    count += merge(nums, left, mid, right)
-    return count
-
-class Solution:
-    def reversePairs(self, nums):
-        return merge_sort(nums, 0, len(nums) - 1)
-
-    ```
-
-  </TabItem>
-  <TabItem value="Java" label="Java">
-  <SolutionAuthor name="@Ishitamukherjee2004"/>
-   ```java
-    public class Solution {
-    public int reversePairs(int[] nums) {
-        return mergeSort(nums, 0, nums.length - 1);
-    }
-
-    public int mergeSort(int[] nums, int left, int right) {
-        if (left >= right) {
-            return 0;
-        }
-        int mid = left + (right - left) / 2;
-        int count = mergeSort(nums, left, mid) + mergeSort(nums, mid + 1, right);
-        count += merge(nums, left, mid, right);
-        return count;
-    }
-     public int merge(int[] nums, int left, int mid, int right) {
-        int count = 0;
-        int j = mid + 1;
-        for (int i = left; i <= mid; i++) {
-            while (j <= right && nums[i] > 2 * nums[j]) {
-                j++;
-            }
-            count += j - mid - 1;
-        }
-        int[] temp = new int[right - left + 1];
-        mergeSortedArrays(nums, left, mid, right, temp);
-        for (int i = left; i <= right; i++) {
-            nums[i] = temp[i - left];
-        }
-        return count;
-    }
-
-    public void
-    mergeSortedArrays(int[] nums, int left, int mid, int right, int[] temp) {
-        int i = left, j = mid + 1, k = 0;
-        while (i <= mid && j <= right) {
-            if (nums[i] <= nums[j]) {
-                temp[k++] = nums[i++];
-            } else {
-                temp[k++] = nums[j++];
-            }
-        }
-        while (i <= mid) {
-            temp[k++] = nums[i++];
-        }
-        while (j <= right) {
-            temp[k++] = nums[j++];
-        }
-    }
-}
-
-    ```
-  </TabItem>
-  <TabItem value="cpp" label="C++">
-  <SolutionAuthor name="@Ishitamukherjee2004"/>
-   ```cpp
-    void mergeSortedArrays(vector<int>& nums, int left, int mid, int right, vector<int>& temp) {
-    int i = left, j = mid + 1, k = 0;
-    while (i <= mid && j <= right) {
-        if (nums[i] <= nums[j]) temp[k++] = nums[i++];
-        else temp[k++] = nums[j++];
-    }
-    while (i <= mid) temp[k++] = nums[i++];
-    while (j <= right) temp[k++] = nums[j++];
-}
-int merge(vector<int>& nums, int left, int mid, int right) {
-    int count = 0;
-    int j = mid + 1;
-    for (int i = left; i <= mid; i++) {
-        while (j <= right && nums[i] > 2 * nums[j]) j++;
-        count += j - mid - 1;
-    }
-    vector<int> temp(right - left + 1);
-    mergeSortedArrays(nums, left, mid, right, temp);
-    for (int i = left; i <= right; i++) nums[i] = temp[i - left];
-    return count;
-}
-int mergeSort(vector<int>& nums, int left, int right) {
-    if (left >= right) return 0;
-    int mid = left + (right - left) / 2;
-    int count = mergeSort(nums, left, mid) + mergeSort(nums, mid + 1, right);
-    count += merge(nums, left, mid, right);
-    return count;
-}
-
-
-class Solution {
-public:
-    int reversePairs(vector<int>& nums) {
-       return mergeSort(nums, 0, nums.size() - 1);
-
-
-    }
-};
-    ```
-  </TabItem>  
-</Tabs>
-
-### Complexity Analysis
-
-- **Time Complexity**: $$O(n*log(n))$$, where n is the length of the input array. This is because the solution uses a modified Merge Sort algorithm, which has a time complexity of O(n log n).
-
-
-- **Space Complexity**: $$O(n)$$, where n is the length of the input array. This is because the solution uses a temporary array to store the merged sorted arrays.
-
-
-
----
-
-<h2>Authors:</h2>
-
-<div style={{display: 'flex', flexWrap: 'wrap', justifyContent: 'space-between', gap: '10px'}}>
-{['Ishitamukherjee2004'].map(username => (
- <Author key={username} username={username} />
+---
+id: reverse-pairs
+title: Reverse Pairs
+sidebar_label: 493-Reverse-Pairs
+tags:
+  - Array
+  - Binary Search
+  - Divide and conquer
+  - Binary Indexed Tree
+  - Segment Tree
+  - Merge Sort
+  - Ordered Set
+description: The problem is to reverse the pairs.
+sidebar_position: 2667
+---
+
+## Problem Statement 
+
+### Problem Description
+
+Given an integer array `nums`, return the number of reverse pairs in the array.
+
+A reverse pair is a pair `(i, j)` where:
+
+`0 <= i < j < nums.length` and
+`nums[i] > 2 * nums[j]`.
+
+### Examples
+
+**Example 1:**
+
+```
+Input: nums = [1,3,2,3,1]
+Output: 2
+Explanation: The reverse pairs are:
+(1, 4) --> nums[1] = 3, nums[4] = 1, 3 > 2 * 1
+(3, 4) --> nums[3] = 3, nums[4] = 1, 3 > 2 * 1
+```
+
+**Example 2:**
+
+```
+Input: nums = [2,4,3,5,1]
+Output: 3
+Explanation: The reverse pairs are:
+(1, 4) --> nums[1] = 4, nums[4] = 1, 4 > 2 * 1
+(2, 4) --> nums[2] = 3, nums[4] = 1, 3 > 2 * 1
+(3, 4) --> nums[3] = 5, nums[4] = 1, 5 > 2 * 1
+```
+
+### Constraints
+
+- `1 <= nums.length <= 5 * 10^4`
+
+## Solution of Given Problem
+
+### Intuition and Approach
+
+The intuition behind this solution is to use a modified Merge Sort algorithm to count the number of reverse pairs in the array.
+
+
+### Approaches
+
+- Divide the array into smaller subarrays until each subarray has only one element.
+- Merge the subarrays back together, counting the number of reverse pairs between each pair of subarrays.
+- The merge step is done in a way that ensures the count of reverse pairs is accurate.
+
+
+#### Codes in Different Languages
+
+<Tabs>
+  <TabItem value="JavaScript" label="JavaScript" default>
+  <SolutionAuthor name="@Ishitamukherjee2004"/>
+   ```javascript
+    function mergeSortedArrays(nums, left, mid, right, temp) {
+  let i = left, j = mid + 1, k = 0;
+  while (i <= mid && j <= right) {
+    if (nums[i] <= nums[j]) temp[k++] = nums[i++];
+    else temp[k++] = nums[j++];
+  }
+  while (i <= mid) temp[k++] = nums[i++];
+  while (j <= right) temp[k++] = nums[j++];
+}
+
+function merge(nums, left, mid, right) {
+  let count = 0;
+  let j = mid + 1;
+  for (let i = left; i <= mid; i++) {
+    while (j <= right && nums[i] > 2 * nums[j]) j++;
+    count += j - mid - 1;
+  }
+  let temp = new Array(right - left + 1);
+  mergeSortedArrays(nums, left, mid, right, temp);
+  for (let i = left; i <= right; i++) nums[i] = temp[i - left];
+  return count;
+}
+function mergeSort(nums, left, right) {
+  if (left >= right) return 0;
+  let mid = left + (right - left) / 2;
+  let count = mergeSort(nums, left, mid) + mergeSort(nums, mid + 1, right);
+  count += merge(nums, left, mid, right);
+  return count;
+}
+
+class Solution {
+  reversePairs(nums) {
+    return mergeSort(nums, 0, nums.length - 1);
+  }
+}
+
+
+    ```
+
+  </TabItem>
+  <TabItem value="TypeScript" label="TypeScript">
+  <SolutionAuthor name="@Ishitamukherjee2004"/> 
+   ```typescript
+    function mergeSortedArrays(nums: number[], left: number, mid: number, right: number, temp: number[]) {
+  let i = left, j = mid + 1, k = 0;
+  while (i <= mid && j <= right) {
+    if (nums[i] <= nums[j]) temp[k++] = nums[i++];
+    else temp[k++] = nums[j++];
+  }
+  while (i <= mid) temp[k++] = nums[i++];
+  while (j <= right) temp[k++] = nums[j++];
+}
+
+function merge(nums: number[], left: number, mid: number, right: number) {
+  let count = 0;
+  let j = mid + 1;
+  for (let i = left; i <= mid; i++) {
+    while (j <= right && nums[i] > 2 * nums[j]) j++;
+    count += j - mid - 1;
+  }
+  let temp = new Array(right - left + 1);
+  mergeSortedArrays(nums, left, mid, right, temp);
+  for (let i = left; i <= right; i++) nums[i] = temp[i - left];
+  return count;
+}
+function mergeSort(nums: number[], left: number, right: number) {
+  if (left >= right) return 0;
+  let mid = left + (right - left) / 2;
+  let count = mergeSort(nums, left, mid) + mergeSort(nums, mid + 1, right);
+  count += merge(nums, left, mid, right);
+  return count;
+}
+
+class Solution {
+  reversePairs(nums: number[]) {
+    return mergeSort(nums, 0, nums.length - 1);
+  }
+}
+
+    ```
+
+  </TabItem>
+  <TabItem value="Python" label="Python"> 
+  <SolutionAuthor name="@Ishitamukherjee2004"/>
+   ```python
+    def merge_sorted_arrays(nums, left, mid, right, temp):
+    i, j, k = left, mid + 1, 0
+    while i <= mid and j <= right:
+        if nums[i] <= nums[j]:
+            temp[k] = nums[i]
+            i += 1
+        else:
+            temp[k] = nums[j]
+            j += 1
+        k += 1
+    while i <= mid:
+        temp[k] = nums[i]
+        i += 1
+        k += 1
+    while j <= right:
+        temp[k] = nums[j]
+        j += 1
+        k += 1
+
+def merge(nums, left, mid, right):
+    count = 0
+    j = mid + 1
+    for i in range(left, mid + 1):
+        while j <= right and nums[i] > 2 * nums[j]:
+            j += 1
+        count += j - mid - 1
+    temp = [0] * (right - left + 1)
+    merge_sorted_arrays(nums, left, mid, right, temp)
+    for i in range(left, right + 1):
+        nums[i] = temp[i - left]
+    return count
+
+def merge_sort(nums, left, right):
+    if left >= right:
+        return 0
+    mid = left + (right - left) // 2
+    count = merge_sort(nums, left, mid) + merge_sort(nums, mid + 1, right)
+    count += merge(nums, left, mid, right)
+    return count
+
+class Solution:
+    def reversePairs(self, nums):
+        return merge_sort(nums, 0, len(nums) - 1)
+
+    ```
+
+  </TabItem>
+  <TabItem value="Java" label="Java">
+  <SolutionAuthor name="@Ishitamukherjee2004"/>
+   ```java
+    public class Solution {
+    public int reversePairs(int[] nums) {
+        return mergeSort(nums, 0, nums.length - 1);
+    }
+
+    public int mergeSort(int[] nums, int left, int right) {
+        if (left >= right) {
+            return 0;
+        }
+        int mid = left + (right - left) / 2;
+        int count = mergeSort(nums, left, mid) + mergeSort(nums, mid + 1, right);
+        count += merge(nums, left, mid, right);
+        return count;
+    }
+     public int merge(int[] nums, int left, int mid, int right) {
+        int count = 0;
+        int j = mid + 1;
+        for (int i = left; i <= mid; i++) {
+            while (j <= right && nums[i] > 2 * nums[j]) {
+                j++;
+            }
+            count += j - mid - 1;
+        }
+        int[] temp = new int[right - left + 1];
+        mergeSortedArrays(nums, left, mid, right, temp);
+        for (int i = left; i <= right; i++) {
+            nums[i] = temp[i - left];
+        }
+        return count;
+    }
+
+    public void
+    mergeSortedArrays(int[] nums, int left, int mid, int right, int[] temp) {
+        int i = left, j = mid + 1, k = 0;
+        while (i <= mid && j <= right) {
+            if (nums[i] <= nums[j]) {
+                temp[k++] = nums[i++];
+            } else {
+                temp[k++] = nums[j++];
+            }
+        }
+        while (i <= mid) {
+            temp[k++] = nums[i++];
+        }
+        while (j <= right) {
+            temp[k++] = nums[j++];
+        }
+    }
+}
+
+    ```
+  </TabItem>
+  <TabItem value="cpp" label="C++">
+  <SolutionAuthor name="@Ishitamukherjee2004"/>
+   ```cpp
+    void mergeSortedArrays(vector<int>& nums, int left, int mid, int right, vector<int>& temp) {
+    int i = left, j = mid + 1, k = 0;
+    while (i <= mid && j <= right) {
+        if (nums[i] <= nums[j]) temp[k++] = nums[i++];
+        else temp[k++] = nums[j++];
+    }
+    while (i <= mid) temp[k++] = nums[i++];
+    while (j <= right) temp[k++] = nums[j++];
+}
+int merge(vector<int>& nums, int left, int mid, int right) {
+    int count = 0;
+    int j = mid + 1;
+    for (int i = left; i <= mid; i++) {
+        while (j <= right && nums[i] > 2 * nums[j]) j++;
+        count += j - mid - 1;
+    }
+    vector<int> temp(right - left + 1);
+    mergeSortedArrays(nums, left, mid, right, temp);
+    for (int i = left; i <= right; i++) nums[i] = temp[i - left];
+    return count;
+}
+int mergeSort(vector<int>& nums, int left, int right) {
+    if (left >= right) return 0;
+    int mid = left + (right - left) / 2;
+    int count = mergeSort(nums, left, mid) + mergeSort(nums, mid + 1, right);
+    count += merge(nums, left, mid, right);
+    return count;
+}
+
+
+class Solution {
+public:
+    int reversePairs(vector<int>& nums) {
+       return mergeSort(nums, 0, nums.size() - 1);
+
+
+    }
+};
+    ```
+  </TabItem>  
+</Tabs>
+
+### Complexity Analysis
+
+- **Time Complexity**: $$O(n*log(n))$$, where n is the length of the input array. This is because the solution uses a modified Merge Sort algorithm, which has a time complexity of O(n log n).
+
+
+- **Space Complexity**: $$O(n)$$, where n is the length of the input array. This is because the solution uses a temporary array to store the merged sorted arrays.
+
+
+
+---
+
+<h2>Authors:</h2>
+
+<div style={{display: 'flex', flexWrap: 'wrap', justifyContent: 'space-between', gap: '10px'}}>
+{['Ishitamukherjee2004'].map(username => (
+ <Author key={username} username={username} />
 ))} </div>
\ No newline at end of file
diff --git a/src/pages/about/index.tsx b/src/pages/about/index.tsx
index 275471d00..306cd55eb 100644
--- a/src/pages/about/index.tsx
+++ b/src/pages/about/index.tsx
@@ -2,14 +2,28 @@ import Layout from "@theme/Layout";
 import AboutUsSection from "../../components/Aboutpage";
 import useDocusaurusContext from '@docusaurus/useDocusaurusContext';
 import React from "react";
+import Head from "@docusaurus/Head";
 
 export default function About() {
-    const {siteConfig} = useDocusaurusContext();
+  const { siteConfig } = useDocusaurusContext();
   return (
     <Layout
       title={`About | ${siteConfig.title}`}
       description="Learn more about Code Harbor Hub and our mission to provide accessible and comprehensive educational resources to learners of all levels."
     >
+      <Head>
+        <script
+          async
+          src="https://pagead2.googlesyndication.com/pagead/js/adsbygoogle.js?client=ca-pub-5832817025080991"
+          crossOrigin="anonymous"
+        />
+        <script
+          async
+          custom-element="amp-auto-ads"
+          src="https://cdn.ampproject.org/v0/amp-auto-ads-0.1.js"
+        />
+        <meta name="google-adsense-account" content="ca-pub-5832817025080991" />
+      </Head>
       <AboutUsSection />
     </Layout>
   );
diff --git a/src/pages/blogs/index.tsx b/src/pages/blogs/index.tsx
index 62bee04e4..874f2f916 100644
--- a/src/pages/blogs/index.tsx
+++ b/src/pages/blogs/index.tsx
@@ -4,6 +4,7 @@ import useDocusaurusContext from "@docusaurus/useDocusaurusContext";
 import Layout from "@theme/Layout";
 import Link from "@docusaurus/Link";
 import blogs from "../../database/blogs";
+import Head from "@docusaurus/Head";
 
 interface Blog {
   id: number;
@@ -21,6 +22,19 @@ export default function Blogs() {
       title={`Blogs from ${siteConfig.title}`}
       description="Welcome to CodeHarborHub Bloge. Learn the basics to advanced concepts of web development. html, css, javascript, react, node.js, dsa, and more."
     >
+      <Head>
+        <script
+          async
+          src="https://pagead2.googlesyndication.com/pagead/js/adsbygoogle.js?client=ca-pub-5832817025080991"
+          crossOrigin="anonymous"
+        />
+        <script
+          async
+          custom-element="amp-auto-ads"
+          src="https://cdn.ampproject.org/v0/amp-auto-ads-0.1.js"
+        />
+        <meta name="google-adsense-account" content="ca-pub-5832817025080991" />
+      </Head>
       <section className="blog-page margin-top--lg margin-bottom--lg">
         <div className="blog-header">
           <h1 className="TitleText">Welcome to CodeHarborHub Blogs </h1>
diff --git a/src/pages/careers/index.tsx b/src/pages/careers/index.tsx
index e1d71bb81..2a477bd4b 100644
--- a/src/pages/careers/index.tsx
+++ b/src/pages/careers/index.tsx
@@ -2,6 +2,7 @@ import React from "react";
 import useDocusaurusContext from "@docusaurus/useDocusaurusContext";
 import Layout from "@theme/Layout";
 import CareerPage from "../../components/CareerPage";
+import Head from "@docusaurus/Head";
 
 export default function Careers() {
   const { siteConfig } = useDocusaurusContext();
@@ -11,6 +12,19 @@ export default function Careers() {
       title={`Careers from ${siteConfig.title}`}
       description="Welcome to CodeHarborHub. Build your career in tech. Find the best opportunities in software engineering, data science, web development, and more."
     >
+      <Head>
+        <script
+          async
+          src="https://pagead2.googlesyndication.com/pagead/js/adsbygoogle.js?client=ca-pub-5832817025080991"
+          crossOrigin="anonymous"
+         />
+        <script
+          async
+          custom-element="amp-auto-ads"
+          src="https://cdn.ampproject.org/v0/amp-auto-ads-0.1.js"
+         />
+        <meta name="google-adsense-account" content="ca-pub-5832817025080991" />
+      </Head>
         <CareerPage />
     </Layout>
   );
diff --git a/src/pages/me.md b/src/pages/me.md
index a7991a50b..7909e9be0 100644
--- a/src/pages/me.md
+++ b/src/pages/me.md
@@ -4,6 +4,20 @@ description: In this page, I will introduce myself.
 hide_table_of_contents: true
 ---
 
+<Head>
+        <script
+          async
+          src="https://pagead2.googlesyndication.com/pagead/js/adsbygoogle.js?client=ca-pub-5832817025080991"
+          crossOrigin="anonymous"
+         />
+        <script
+          async
+          custom-element="amp-auto-ads"
+          src="https://cdn.ampproject.org/v0/amp-auto-ads-0.1.js"
+         />
+        <meta name="google-adsense-account" content="ca-pub-5832817025080991" />
+      </Head>
+
 # Introduction (परिचयः) 🙏
 
 [![An image of @ajaydhangar's Holopin badges, which is a link to view their full Holopin profile](https://holopin.me/ajaydhangar)](https://holopin.io/@ajaydhangar)
diff --git a/src/pages/our-sponsors/index.tsx b/src/pages/our-sponsors/index.tsx
index 522aaf49c..c0b95cb14 100644
--- a/src/pages/our-sponsors/index.tsx
+++ b/src/pages/our-sponsors/index.tsx
@@ -4,6 +4,7 @@ import "./Sponsors.css";
 import Layout from "@theme/Layout";
 import sponsors from "../../database/sponsors";
 import { FaPlusCircle } from 'react-icons/fa';
+import Head from "@docusaurus/Head";
 
 const OurSponsors: React.FC = () => {
   const [showScanner, setShowScanner] = useState(false);
@@ -20,6 +21,19 @@ const OurSponsors: React.FC = () => {
 
   return (
     <Layout>
+      <Head>
+        <script
+          async
+          src="https://pagead2.googlesyndication.com/pagead/js/adsbygoogle.js?client=ca-pub-5832817025080991"
+          crossOrigin="anonymous"
+         />
+        <script
+          async
+          custom-element="amp-auto-ads"
+          src="https://cdn.ampproject.org/v0/amp-auto-ads-0.1.js"
+         />
+        <meta name="google-adsense-account" content="ca-pub-5832817025080991" />
+      </Head>
       <div className="sponsor-page">
         <div className="sponsor-header">
           <h1 className="TitleText">Our Sponsors</h1>
diff --git a/src/pages/output.css b/src/pages/output.css
deleted file mode 100644
index dd9be1425..000000000
--- a/src/pages/output.css
+++ /dev/null
@@ -1,642 +0,0 @@
-/*
-! tailwindcss v3.4.4 | MIT License | https://tailwindcss.com
-*/
-
-/*
-1. Prevent padding and border from affecting element width. (https://github.com/mozdevs/cssremedy/issues/4)
-2. Allow adding a border to an element by just adding a border-width. (https://github.com/tailwindcss/tailwindcss/pull/116)
-*/
-
-*,
-::before,
-::after {
-  box-sizing: border-box;
-  /* 1 */
-  border-width: 0;
-  /* 2 */
-  border-style: solid;
-  /* 2 */
-  border-color: #e5e7eb;
-  /* 2 */
-}
-
-::before,
-::after {
-  --tw-content: '';
-}
-
-/*
-1. Use a consistent sensible line-height in all browsers.
-2. Prevent adjustments of font size after orientation changes in iOS.
-3. Use a more readable tab size.
-4. Use the user's configured `sans` font-family by default.
-5. Use the user's configured `sans` font-feature-settings by default.
-6. Use the user's configured `sans` font-variation-settings by default.
-7. Disable tap highlights on iOS
-*/
-
-html,
-:host {
-  line-height: 1.5;
-  /* 1 */
-  -webkit-text-size-adjust: 100%;
-  /* 2 */
-  /* 3 */
-  tab-size: 4;
-  /* 3 */
-  font-family: ui-sans-serif, system-ui, sans-serif, "Apple Color Emoji", "Segoe UI Emoji", "Segoe UI Symbol", "Noto Color Emoji";
-  /* 4 */
-  font-feature-settings: normal;
-  /* 5 */
-  font-variation-settings: normal;
-  /* 6 */
-  -webkit-tap-highlight-color: transparent;
-  /* 7 */
-}
-
-/*
-1. Remove the margin in all browsers.
-2. Inherit line-height from `html` so users can set them as a class directly on the `html` element.
-*/
-
-body {
-  margin: 0;
-  /* 1 */
-  line-height: inherit;
-  /* 2 */
-}
-
-/*
-1. Add the correct height in Firefox.
-2. Correct the inheritance of border color in Firefox. (https://bugzilla.mozilla.org/show_bug.cgi?id=190655)
-3. Ensure horizontal rules are visible by default.
-*/
-
-hr {
-  height: 0;
-  /* 1 */
-  color: inherit;
-  /* 2 */
-  border-top-width: 1px;
-  /* 3 */
-}
-
-/*
-Add the correct text decoration in Chrome, Edge, and Safari.
-*/
-
-abbr:where([title]) {
-  -webkit-text-decoration: underline dotted;
-          text-decoration: underline dotted;
-}
-
-/*
-Remove the default font size and weight for headings.
-*/
-
-h1,
-h2,
-h3,
-h4,
-h5,
-h6 {
-  font-size: inherit;
-  font-weight: inherit;
-}
-
-/*
-Reset links to optimize for opt-in styling instead of opt-out.
-*/
-
-a {
-  color: inherit;
-  text-decoration: inherit;
-}
-
-/*
-Add the correct font weight in Edge and Safari.
-*/
-
-b,
-strong {
-  font-weight: bolder;
-}
-
-/*
-1. Use the user's configured `mono` font-family by default.
-2. Use the user's configured `mono` font-feature-settings by default.
-3. Use the user's configured `mono` font-variation-settings by default.
-4. Correct the odd `em` font sizing in all browsers.
-*/
-
-code,
-kbd,
-samp,
-pre {
-  font-family: ui-monospace, SFMono-Regular, Menlo, Monaco, Consolas, "Liberation Mono", "Courier New", monospace;
-  /* 1 */
-  font-feature-settings: normal;
-  /* 2 */
-  font-variation-settings: normal;
-  /* 3 */
-  font-size: 1em;
-  /* 4 */
-}
-
-/*
-Add the correct font size in all browsers.
-*/
-
-small {
-  font-size: 80%;
-}
-
-/*
-Prevent `sub` and `sup` elements from affecting the line height in all browsers.
-*/
-
-sub,
-sup {
-  font-size: 75%;
-  line-height: 0;
-  position: relative;
-  vertical-align: baseline;
-}
-
-sub {
-  bottom: -0.25em;
-}
-
-sup {
-  top: -0.5em;
-}
-
-/*
-1. Remove text indentation from table contents in Chrome and Safari. (https://bugs.chromium.org/p/chromium/issues/detail?id=999088, https://bugs.webkit.org/show_bug.cgi?id=201297)
-2. Correct table border color inheritance in all Chrome and Safari. (https://bugs.chromium.org/p/chromium/issues/detail?id=935729, https://bugs.webkit.org/show_bug.cgi?id=195016)
-3. Remove gaps between table borders by default.
-*/
-
-table {
-  text-indent: 0;
-  /* 1 */
-  border-color: inherit;
-  /* 2 */
-  border-collapse: collapse;
-  /* 3 */
-}
-
-/*
-1. Change the font styles in all browsers.
-2. Remove the margin in Firefox and Safari.
-3. Remove default padding in all browsers.
-*/
-
-button,
-input,
-optgroup,
-select,
-textarea {
-  font-family: inherit;
-  /* 1 */
-  font-feature-settings: inherit;
-  /* 1 */
-  font-variation-settings: inherit;
-  /* 1 */
-  font-size: 100%;
-  /* 1 */
-  font-weight: inherit;
-  /* 1 */
-  line-height: inherit;
-  /* 1 */
-  letter-spacing: inherit;
-  /* 1 */
-  color: inherit;
-  /* 1 */
-  margin: 0;
-  /* 2 */
-  padding: 0;
-  /* 3 */
-}
-
-/*
-Remove the inheritance of text transform in Edge and Firefox.
-*/
-
-button,
-select {
-  text-transform: none;
-}
-
-/*
-1. Correct the inability to style clickable types in iOS and Safari.
-2. Remove default button styles.
-*/
-
-button,
-input:where([type='button']),
-input:where([type='reset']),
-input:where([type='submit']) {
-  -webkit-appearance: button;
-  /* 1 */
-  background-color: transparent;
-  /* 2 */
-  background-image: none;
-  /* 2 */
-}
-
-/*
-Use the modern Firefox focus style for all focusable elements.
-*/
-
-:-moz-focusring {
-  outline: auto;
-}
-
-/*
-Remove the additional `:invalid` styles in Firefox. (https://github.com/mozilla/gecko-dev/blob/2f9eacd9d3d995c937b4251a5557d95d494c9be1/layout/style/res/forms.css#L728-L737)
-*/
-
-:-moz-ui-invalid {
-  box-shadow: none;
-}
-
-/*
-Add the correct vertical alignment in Chrome and Firefox.
-*/
-
-progress {
-  vertical-align: baseline;
-}
-
-/*
-Correct the cursor style of increment and decrement buttons in Safari.
-*/
-
-::-webkit-inner-spin-button,
-::-webkit-outer-spin-button {
-  height: auto;
-}
-
-/*
-1. Correct the odd appearance in Chrome and Safari.
-2. Correct the outline style in Safari.
-*/
-
-[type='search'] {
-  -webkit-appearance: textfield;
-  /* 1 */
-  outline-offset: -2px;
-  /* 2 */
-}
-
-/*
-Remove the inner padding in Chrome and Safari on macOS.
-*/
-
-::-webkit-search-decoration {
-  -webkit-appearance: none;
-}
-
-/*
-1. Correct the inability to style clickable types in iOS and Safari.
-2. Change font properties to `inherit` in Safari.
-*/
-
-::-webkit-file-upload-button {
-  -webkit-appearance: button;
-  /* 1 */
-  font: inherit;
-  /* 2 */
-}
-
-/*
-Add the correct display in Chrome and Safari.
-*/
-
-summary {
-  display: list-item;
-}
-
-/*
-Removes the default spacing and border for appropriate elements.
-*/
-
-blockquote,
-dl,
-dd,
-h1,
-h2,
-h3,
-h4,
-h5,
-h6,
-hr,
-figure,
-p,
-pre {
-  margin: 0;
-}
-
-fieldset {
-  margin: 0;
-  padding: 0;
-}
-
-legend {
-  padding: 0;
-}
-
-ol,
-ul,
-menu {
-  list-style: none;
-  margin: 0;
-  padding: 0;
-}
-
-/*
-Reset default styling for dialogs.
-*/
-
-dialog {
-  padding: 0;
-}
-
-/*
-Prevent resizing textareas horizontally by default.
-*/
-
-textarea {
-  resize: vertical;
-}
-
-/*
-1. Reset the default placeholder opacity in Firefox. (https://github.com/tailwindlabs/tailwindcss/issues/3300)
-2. Set the default placeholder color to the user's configured gray 400 color.
-*/
-
-input::placeholder,
-textarea::placeholder {
-  opacity: 1;
-  /* 1 */
-  color: #9ca3af;
-  /* 2 */
-}
-
-/*
-Set the default cursor for buttons.
-*/
-
-button,
-[role="button"] {
-  cursor: pointer;
-}
-
-/*
-Make sure disabled buttons don't get the pointer cursor.
-*/
-
-:disabled {
-  cursor: default;
-}
-
-/*
-1. Make replaced elements `display: block` by default. (https://github.com/mozdevs/cssremedy/issues/14)
-2. Add `vertical-align: middle` to align replaced elements more sensibly by default. (https://github.com/jensimmons/cssremedy/issues/14#issuecomment-634934210)
-   This can trigger a poorly considered lint error in some tools but is included by design.
-*/
-
-img,
-svg,
-video,
-canvas,
-audio,
-iframe,
-embed,
-object {
-  display: block;
-  /* 1 */
-  vertical-align: middle;
-  /* 2 */
-}
-
-/*
-Constrain images and videos to the parent width and preserve their intrinsic aspect ratio. (https://github.com/mozdevs/cssremedy/issues/14)
-*/
-
-img,
-video {
-  max-width: 100%;
-  height: auto;
-}
-
-/* Make elements with the HTML hidden attribute stay hidden by default */
-
-[hidden] {
-  display: none;
-}
-
-*, ::before, ::after {
-  --tw-border-spacing-x: 0;
-  --tw-border-spacing-y: 0;
-  --tw-translate-x: 0;
-  --tw-translate-y: 0;
-  --tw-rotate: 0;
-  --tw-skew-x: 0;
-  --tw-skew-y: 0;
-  --tw-scale-x: 1;
-  --tw-scale-y: 1;
-  --tw-pan-x:  ;
-  --tw-pan-y:  ;
-  --tw-pinch-zoom:  ;
-  --tw-scroll-snap-strictness: proximity;
-  --tw-gradient-from-position:  ;
-  --tw-gradient-via-position:  ;
-  --tw-gradient-to-position:  ;
-  --tw-ordinal:  ;
-  --tw-slashed-zero:  ;
-  --tw-numeric-figure:  ;
-  --tw-numeric-spacing:  ;
-  --tw-numeric-fraction:  ;
-  --tw-ring-inset:  ;
-  --tw-ring-offset-width: 0px;
-  --tw-ring-offset-color: #fff;
-  --tw-ring-color: rgb(59 130 246 / 0.5);
-  --tw-ring-offset-shadow: 0 0 #0000;
-  --tw-ring-shadow: 0 0 #0000;
-  --tw-shadow: 0 0 #0000;
-  --tw-shadow-colored: 0 0 #0000;
-  --tw-blur:  ;
-  --tw-brightness:  ;
-  --tw-contrast:  ;
-  --tw-grayscale:  ;
-  --tw-hue-rotate:  ;
-  --tw-invert:  ;
-  --tw-saturate:  ;
-  --tw-sepia:  ;
-  --tw-drop-shadow:  ;
-  --tw-backdrop-blur:  ;
-  --tw-backdrop-brightness:  ;
-  --tw-backdrop-contrast:  ;
-  --tw-backdrop-grayscale:  ;
-  --tw-backdrop-hue-rotate:  ;
-  --tw-backdrop-invert:  ;
-  --tw-backdrop-opacity:  ;
-  --tw-backdrop-saturate:  ;
-  --tw-backdrop-sepia:  ;
-  --tw-contain-size:  ;
-  --tw-contain-layout:  ;
-  --tw-contain-paint:  ;
-  --tw-contain-style:  ;
-}
-
-::backdrop {
-  --tw-border-spacing-x: 0;
-  --tw-border-spacing-y: 0;
-  --tw-translate-x: 0;
-  --tw-translate-y: 0;
-  --tw-rotate: 0;
-  --tw-skew-x: 0;
-  --tw-skew-y: 0;
-  --tw-scale-x: 1;
-  --tw-scale-y: 1;
-  --tw-pan-x:  ;
-  --tw-pan-y:  ;
-  --tw-pinch-zoom:  ;
-  --tw-scroll-snap-strictness: proximity;
-  --tw-gradient-from-position:  ;
-  --tw-gradient-via-position:  ;
-  --tw-gradient-to-position:  ;
-  --tw-ordinal:  ;
-  --tw-slashed-zero:  ;
-  --tw-numeric-figure:  ;
-  --tw-numeric-spacing:  ;
-  --tw-numeric-fraction:  ;
-  --tw-ring-inset:  ;
-  --tw-ring-offset-width: 0px;
-  --tw-ring-offset-color: #fff;
-  --tw-ring-color: rgb(59 130 246 / 0.5);
-  --tw-ring-offset-shadow: 0 0 #0000;
-  --tw-ring-shadow: 0 0 #0000;
-  --tw-shadow: 0 0 #0000;
-  --tw-shadow-colored: 0 0 #0000;
-  --tw-blur:  ;
-  --tw-brightness:  ;
-  --tw-contrast:  ;
-  --tw-grayscale:  ;
-  --tw-hue-rotate:  ;
-  --tw-invert:  ;
-  --tw-saturate:  ;
-  --tw-sepia:  ;
-  --tw-drop-shadow:  ;
-  --tw-backdrop-blur:  ;
-  --tw-backdrop-brightness:  ;
-  --tw-backdrop-contrast:  ;
-  --tw-backdrop-grayscale:  ;
-  --tw-backdrop-hue-rotate:  ;
-  --tw-backdrop-invert:  ;
-  --tw-backdrop-opacity:  ;
-  --tw-backdrop-saturate:  ;
-  --tw-backdrop-sepia:  ;
-  --tw-contain-size:  ;
-  --tw-contain-layout:  ;
-  --tw-contain-paint:  ;
-  --tw-contain-style:  ;
-}
-
-.static {
-  position: static;
-}
-
-.absolute {
-  position: absolute;
-}
-
-.flex {
-  display: flex;
-}
-
-.hidden {
-  display: none;
-}
-
-.transform {
-  transform: translate(var(--tw-translate-x), var(--tw-translate-y)) rotate(var(--tw-rotate)) skewX(var(--tw-skew-x)) skewY(var(--tw-skew-y)) scaleX(var(--tw-scale-x)) scaleY(var(--tw-scale-y));
-}
-
-.resize {
-  resize: both;
-}
-
-.border {
-  border-width: 1px;
-}
-
-.transition {
-  transition-property: color, background-color, border-color, text-decoration-color, fill, stroke, opacity, box-shadow, transform, filter, -webkit-backdrop-filter;
-  transition-property: color, background-color, border-color, text-decoration-color, fill, stroke, opacity, box-shadow, transform, filter, backdrop-filter;
-  transition-property: color, background-color, border-color, text-decoration-color, fill, stroke, opacity, box-shadow, transform, filter, backdrop-filter, -webkit-backdrop-filter;
-  transition-timing-function: cubic-bezier(0.4, 0, 0.2, 1);
-  transition-duration: 150ms;
-}
-
-.main__home {
-  background: linear-gradient(rgb(255 255 255), rgb(255 255 255/50%));
-}
-
-[data-theme='dark'] .main__home {
-  background: linear-gradient(rgb(15 23 42), rgb(15 23 42/50%));
-}
-
-.home__header {
-  margin: 1rem;
-}
-
-.home__divider h2 {
-  text-align: center;
-}
-
-.home__hr {
-  background-color: var(--ifm-color-primary);
-  margin: 2rem auto;
-}
-
-.home__divider {
-  margin: 2rem auto;
-}
-
-.home__divider::after {
-  content: "";
-  display: block;
-  margin: 10px auto;
-  width: 100px;
-  height: 2px;
-  background-color: var(--ifm-color-primary);
-}
-
-.section {
-  padding: 1rem;
-}
-
-.rateUsButton {
-  display: block;
-  margin: 20px auto;
-  padding: 10px 20px;
-  background: #007bff;
-  color: white;
-  border: none;
-  border-radius: 4px;
-  cursor: pointer;
-  text-align: center;
-}
-
-.tweetContainer {
-  transition: transform 0.3s ease, box-shadow 0.3s ease, background-color 0.3s ease;
-  margin-bottom: 1rem;
-}
-
-.tweetContainer:hover {
-  transform: scale(1.1);
-  box-shadow: 0 8px 16px rgba(0, 0, 0, 0.2);
-}
\ No newline at end of file
diff --git a/src/pages/roadmap/index.tsx b/src/pages/roadmap/index.tsx
index f9b208d0d..871efff2d 100644
--- a/src/pages/roadmap/index.tsx
+++ b/src/pages/roadmap/index.tsx
@@ -1,17 +1,26 @@
 import React from "react";
 import Layout from "@theme/Layout";
 import Roadmaps from "../../components/Roadmap";
-
+import Head from "@docusaurus/Head";
 
 export default function RoadMap() {
-
   return (
-    <Layout
-      title={"RoadMap for Learning"}
-      description="RoadMap for Learning"
-    >
+    <Layout title={"RoadMap for Learning"} description="RoadMap for Learning">
+      <Head>
+        <script
+          async
+          src="https://pagead2.googlesyndication.com/pagead/js/adsbygoogle.js?client=ca-pub-5832817025080991"
+          crossOrigin="anonymous"
+        />
+        <script
+          async
+          custom-element="amp-auto-ads"
+          src="https://cdn.ampproject.org/v0/amp-auto-ads-0.1.js"
+        />
+        <meta name="google-adsense-account" content="ca-pub-5832817025080991" />
+      </Head>
       <main>
-          <Roadmaps />
+        <Roadmaps />
       </main>
     </Layout>
   );
diff --git a/src/pages/showcase/index.tsx b/src/pages/showcase/index.tsx
index e102f902c..4aaa7c3a0 100644
--- a/src/pages/showcase/index.tsx
+++ b/src/pages/showcase/index.tsx
@@ -1,7 +1,7 @@
 import React, { useState, useMemo, useEffect } from 'react';
 import Layout from '@theme/Layout';
 import clsx from 'clsx';
-
+import Head from "@docusaurus/Head";
 import FavoriteIcon from '../../components/svgIcons/FavoriteIcon';
 import ShowcaseTagSelect, {
   readSearchTags,
@@ -448,6 +448,19 @@ export default function Showcase(): JSX.Element {
       title={"Showcase of CodeHarborHub"}
       description="Showcase of CodeHarborHub for CodeHarborHub Learners, and users"
     >
+      <Head>
+        <script
+          async
+          src="https://pagead2.googlesyndication.com/pagead/js/adsbygoogle.js?client=ca-pub-5832817025080991"
+          crossOrigin="anonymous"
+         />
+        <script
+          async
+          custom-element="amp-auto-ads"
+          src="https://cdn.ampproject.org/v0/amp-auto-ads-0.1.js"
+         />
+        <meta name="google-adsense-account" content="ca-pub-5832817025080991" />
+      </Head>
       <main className="margin-vert--lg">
         <ShowcaseHeader />
         <ShowcaseFilters />
@@ -455,4 +468,4 @@ export default function Showcase(): JSX.Element {
       </main>
     </Layout>
   );
-}
\ No newline at end of file
+}