From 70f87c23ff94c6f10f7489b4a794061b82dc759a Mon Sep 17 00:00:00 2001 From: Satvikdeep Date: Tue, 18 Feb 2025 01:06:46 +0530 Subject: [PATCH 1/2] feat: Added three code snippets in C++ --- lib/code-snippets.ts | 26 +++++++++++++++++++++++++- 1 file changed, 25 insertions(+), 1 deletion(-) diff --git a/lib/code-snippets.ts b/lib/code-snippets.ts index 7991f75..554ddcf 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& 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: 'easy', + 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 : 'medium', + 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 if else (x > nums[mid]) {\n low = mid+1;\n }/n else{\n high = mid-1;\n }\n }\n return -1;\n}' + } + +]; + From 08da78367e589913234058f0e1ef3b9eab6672b1 Mon Sep 17 00:00:00 2001 From: Satvikdeep Date: Tue, 18 Feb 2025 05:25:34 +0530 Subject: [PATCH 2/2] feat: Added three code snippets in C++ with corrected indentation --- lib/code-snippets.ts | 10 +++++----- 1 file changed, 5 insertions(+), 5 deletions(-) diff --git a/lib/code-snippets.ts b/lib/code-snippets.ts index 554ddcf..336354a 100644 --- a/lib/code-snippets.ts +++ b/lib/code-snippets.ts @@ -55,22 +55,22 @@ export const codeSnippets: CodeSnippet[] = [ language: 'C++', name: 'Bubble Sort', difficulty: 'medium', - code: 'void bubbleSort(vector& 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}' + code: 'void bubbleSort(vector& 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: 'easy', - 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}' + 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 : 'medium', - 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 if else (x > nums[mid]) {\n low = mid+1;\n }/n else{\n high = mid-1;\n }\n }\n return -1;\n}' + 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}' } ];