diff --git a/lib/code-snippets.ts b/lib/code-snippets.ts
index 7991f75..336354a 100644
--- a/lib/code-snippets.ts
+++ b/lib/code-snippets.ts
@@ -50,4 +50,28 @@ export const codeSnippets: CodeSnippet[] = [
     difficulty: 'medium',
     code: catParagraphs[Math.floor(Math.random() * catParagraphs.length)]
   },
-]; 
\ No newline at end of file
+  {
+    id: 'bubble-sort',
+    language: 'C++',
+    name: 'Bubble Sort',
+    difficulty: 'medium',
+    code: 'void bubbleSort(vector<int>& nums) {\n    int n = nums.size();\n    for (int i = 0; i < n - 1; i++) {\n        for (int j = 0; j < n - i - 1; j++) {\n            if (v[j] > v[j + 1]){\n                swap(v[j], v[j + 1]);\n            }\n        }\n    }\n}'
+  },
+  {
+	id : 'isPalindrome',
+	language: 'C++',
+	name: 'Check for Palindrome',
+	difficulty: 'medium',
+	code : 'string isPalindrome(string str){\n    string rev = s;\n    reverse(rev.begin(), rev.end());\n    if (str == rev) {\n        cout << str << " is Palindrome";\n    }\n    else {\n        cout << str << " is not a Palindrome";\n    }\n}'
+  },
+
+  {
+	id : 'binary-search',
+	language : 'C++',
+	name : 'Binary Search',
+	difficulty : 'hard',
+	code : 'int BinarySearch(int nums[], int k) {\n    int n = nums.size();\n    int high = nums[0];\n    int low = nums[n-1];\n    while (high >= low){\n        int mid = (low+mid)/2;\n        if(nums[mid] == x)  {\n            return arr[mid];\n        }\n        else if (x > nums[mid]) {\n            low = mid+1;\n        }\n        else {\n            high = mid-1;\n        }\n    }\n    return -1;\n}'
+  }
+
+]; 
+