Skip to content

feat: Added three code snippets in C++ #8

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
Satvikdeep wants to merge 2 commits into
base: main
Choose a base branch
from
Open

feat: Added three code snippets in C++ #8

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
70f87c2
feat: Added three code snippets in C++
Satvikdeep Feb 17, 2025
08da783
feat: Added three code snippets in C++ with corrected indentation
Satvikdeep Feb 17, 2025
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
26 changes: 25 additions & 1 deletion lib/code-snippets.ts
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -50,4 +50,28 @@ export const codeSnippets: CodeSnippet[] = [
difficulty: 'medium',
code: catParagraphs[Math.floor(Math.random() * catParagraphs.length)]
},
];
{
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}'
}

];