C Programming Language || Hands On Coding
описание
Hands-on C programming language challenges for beginners. Learn building logic by solving programs. Owner: @Pradeep_saii
12 880
подписчиков
Охват к подписчикам
73,0%
ERR
Реакции к просмотрам
0,07%
157 на 22 постов
Пересылки к просмотрам
0,06%
125
Постов в день
0,0
всего 22
Где отзываются чаще
доля реакций к просмотрам- 5 авг.🚀 HandsOnC – 60 Day Challenge begins on 24 August 2026. If you're a beginner and want to learn C the right way, you're in the right place. 📅 Challenge Starts: 24 August 2026 Invite your classmates or friends who are learning C and begin the HandsOnC – 60 Day Challenge together on 24 August. Link: https://t.me/c_programming_language_coding See you on 24 August! 🚀0,27%
- 23 июл.If you're struggling to understand codes. Try out this⏬ https://interactive-code-explainer.vercel.app Prefer using it in PC. It breaks your code into logical blocks and provides explanation to each block of code.0,20%
- 4 февр. 2025 г.Program: Reversing of a number. #include <iostream> using namespace std; int reverseNumber(int num) { int reversedNum = 0; while (num > 0) { int rem = num % 10; reversedNum = reversedNum * 10 + rem; num /= 10; } return reversedNum; } int main() { int num; cout << "Enter the number to reverse: "; cin >> num; int reversedNum = reverseNumber(num); cout << "Reverse of " << num << " is " << reversedNum << endl; return 0; }0,15%
- 24 февр. 2025 г.Program: Searching in a 2D array. #include <iostream> using namespace std; int* search(int arr[][3], int rows, int cols, int target) { static int result[2]; result[0] = -1; result[1] = -1; for (int i = 0; i < rows; i++) { for (int j = 0; j < cols; j++) { if (arr[i][j] == target) { result[0] = i; result[1] = j; return result; } } } return result; } int main() { int arr[3][3] = { {20, 45, 10}, {32, 26, 22}, {47, 98, 37} }; int target; cout << "Enter target element: "; cin >> target; int* result = search(arr, 3, 3, target); if (result[0] != -1) { cout << "Element found at index (" << result[0] << "," << result[1] << ")" << endl; } else { cout << "Element not found" << endl; } return 0; } #linearsearch0,14%
- 6 февр. 2025 г.Program : Prime or Not #include <iostream> using namespace std; bool isPrime(int num) { if (num < 2) { return false; } for (int i = 2; i * i <= num; i++) { if (num % i == 0) { return false; } } return true; } int main() { int num; cout << "Enter any number: "; cin >> num; if (isPrime(num)) { cout << num << " is a prime number" << endl; } else { cout << num << " is not a prime number" << endl; } return 0; }0,11%
- 19 мар. 2025 г.Leetcode 350: https://leetcode.com/problems/intersection-of-two-arrays-ii/ class Solution { public: std::vector<int> intersect(std::vector<int>& nums1, std::vector<int>& nums2) { std::unordered_map<int, int> numsMap; std::vector<int> intersectedNums; for (int num : nums1) { numsMap[num]++; } for (int num : nums2) { if (numsMap.find(num) != numsMap.end() && numsMap[num] > 0) { intersectedNums.push_back(num); numsMap[num]--; if (numsMap[num] == 0) { numsMap.erase(num); } } } return intersectedNums; } };0,11%
- 11 февр. 2025 г.Program : Finding Maximum element in an Array. #include <iostream> using namespace std; int findMax(int arr[], int size) { int maxElem = arr[0]; for(int i = 1; i < size; i++) { if(maxElem < arr[i]) { maxElem = arr[i]; } } return maxElem; } int main() { int arr[] = {10, 5, 1, 3, 6}; int size = sizeof(arr) / sizeof(arr[0]); int maxElem = findMax(arr, size); cout << "Maximum Element : " << maxElem << endl; return 0; }0,10%
- 21 мар. 2025 г.Leetcode 283: https://leetcode.com/problems/move-zeroes/ class Solution { public: void moveZeroes(vector<int>& nums) { if (nums.size() < 2) { return; } int leftIdx = 0, rightIdx = 1; while (rightIdx < nums.size()) { if (nums[leftIdx] != 0) { leftIdx++; rightIdx++; } else if (nums[rightIdx] == 0) { rightIdx++; } else { swap(nums[leftIdx], nums[rightIdx]); } } } };0,10%
- 19 февр. 2025 г.Program: Searching for first occurrence of a character in a string. #include <iostream> using namespace std; int searchInStr(string str, char ch) { for (int i = 0; i < str.length(); i++) { if (str[i] == ch) { return i; } } return -1; } int main() { string str = "Java Programming"; char ch; cout << "Enter character to search: "; cin >> ch; int res = searchInStr(str, ch); if (res == -1) { cout << "Character not found in the String" << endl; } else { cout << "Character is at index " << res << endl; } return 0; }0,09%
- 6 февр. 2025 г.Program : Armstrong or Not #include <iostream> #include <cmath> using namespace std; bool isArmstrong(int num) { int originalNum = num, sum = 0, digits = to_string(num).length(); while (num > 0) { int rem = num % 10; sum += pow(rem, digits); num /= 10; } return originalNum == sum; } int main() { int num; cout << "Enter any number: "; cin >> num; if (isArmstrong(num)) { cout << num << " is an Armstrong number." << endl; } else { cout << num << " is not an Armstrong number." << endl; } return 0; }0,09%
- 13 мар. 2025 г.Leetcode 26: https://leetcode.com/problems/remove-duplicates-from-sorted-array/description/ class Solution { public: int removeDuplicates(vector<int>& nums) { int lastUniqueElementIdx = 0; for (int i = 1; i < nums.size(); i++) { if (nums[lastUniqueElementIdx] != nums[i]) { nums[lastUniqueElementIdx + 1] = nums[i]; lastUniqueElementIdx++; } } return lastUniqueElementIdx + 1; } };0,08%
- 12 февр. 2025 г.Program: Reversing of an Array. #include <iostream> #include <vector> using namespace std; void reverseArray(vector<int>& arr) { int n = arr.size(); for (int i = 0; i < n / 2; i++) { swap(arr[i], arr[n - 1 - i]); } } int main() { vector<int> arr = {1, 2, 3, 4, 5, 6}; reverseArray(arr); for (size_t i = 0; i < arr.size(); i++) { cout << arr[i] << " "; } cout << endl; return 0; }0,07%