Ad

C PROGRAMMING LANGUAGE PROGRAMS

C PROGRAMMING LANGUAGE PROGRAMS

Public

Voir la chaîne

Vous ne pouvez pas rejoindre ? @c_programming_language_program

0

14.1k Membre

Mis à jour: April 6, 2026 at 2:55 AM

Ad

About C PROGRAMMING LANGUAGE PROGRAMS – Codage & Programmation Telegram Channel

C Programming Codes || Quizzes || DSA Learn along with the community Any queries admin - @Pradeep_saii

@c_programming_language_program is a dedicated channel for learn and queries with regular updates in Codage & Programmation

Classement

Classement mondial

#456

+2

Classement par langue

#45

+1

Classement par catégorie

#23

-1

Croissance des abonnés (Les 2 derniers jours)

Total: 14.1K

Croissance sur 24h: -34 0%

Ad

Loading...

Note

Connexion requise

Loading...

Loading recommended channels...

Derniers articles

C PROGRAMMING LANGUAGE PROGRAMS

3 avr. 2026, 23:30

Program: Finding maximum element from an array.
#include 
using namespace std;

int findMax(int arr[], int size) {
int max = arr[0];
for (int i = 1; i < size; i++) {
if (arr[i] > max) {
max = arr[i];
}
}
return max;
}

int main() {
int arr[] = {12, 32, 23, 11, 39};
int size = sizeof(arr) / sizeof(arr[0]);
int maxNumber = findMax(arr, size);
cout << "Maximum number in array: " << maxNumber << endl;
return 0;
}

8,270

4

0

C PROGRAMMING LANGUAGE PROGRAMS

3 avr. 2026, 23:30

Program: Searching in a 2D array.
#include 
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;
}

#linearsearch

9,120

14

C PROGRAMMING LANGUAGE PROGRAMS

3 avr. 2026, 23:30

Leetcode 26:
https://leetcode.com/problems/remove-duplicates-from-sorted-array/description/

class Solution {
public:
int removeDuplicates(vector& 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;
}
};

7,550

7

0

C PROGRAMMING LANGUAGE PROGRAMS

3 avr. 2026, 23:30

Program: Searching for first occurrence of a character in a string.
#include 
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;
}

7,080

6

0

C PROGRAMMING LANGUAGE PROGRAMS

3 avr. 2026, 23:30

Program: Searching for a character in specified range.
#include 
#include 

using namespace std;

int searchInStr(const string &str, char ch, int start, int end) {
for (int i = start; i <= end; i++) {
if (str[i] == ch) {
return i;
}
}
return -1;
}

int main() {
string str = "Java Programming";
char ch;
int start, end;

cout << "Enter character to search: ";
cin >> ch;

cout << "Enter the range,\n";
cout << "Enter the start index: ";
cin >> start;
cout << "Enter the end index: ";
cin >> end;

int res = searchInStr(str, ch, start, end);

if (res == -1) {
cout << "Character not found in the specified range" << endl;
} else {
cout << "Character is at index " << res << endl;
}

return 0;
}

8,100

2

C PROGRAMMING LANGUAGE PROGRAMS

3 avr. 2026, 23:30

Program: Finding minimum element in an array.
#include 
using namespace std;

int findMin(int arr[], int size) {
int min = arr[0];
for (int i = 1; i < size; i++) {
if (arr[i] < min) {
min = arr[i];
}
}
return min;
}

int main() {
int arr[] = {12, 32, 23, 11, 39};
int size = sizeof(arr) / sizeof(arr[0]);
int minNumber = findMin(arr, size);
cout << "Minimum number in array: " << minNumber << endl;
return 0;
}

8,070

6

0

C PROGRAMMING LANGUAGE PROGRAMS

3 avr. 2026, 23:30

Program : Armstrong or Not
#include 
#include 
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;
}

7,640

7

0

C PROGRAMMING LANGUAGE PROGRAMS

3 avr. 2026, 23:30

Program : Finding Maximum element in an Array.
#include 
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;
}

8,250

9

0

C PROGRAMMING LANGUAGE PROGRAMS

3 avr. 2026, 23:30

Program: Reversing of an Array.
#include 
#include 
using namespace std;

void reverseArray(vector& arr) {
int n = arr.size();
for (int i = 0; i < n / 2; i++) {
swap(arr[i], arr[n - 1 - i]);
}
}

int main() {
vector 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;
}

8,980

6

0

C PROGRAMMING LANGUAGE PROGRAMS

3 avr. 2026, 23:30

Program : Prime or Not
#include 
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;
}

6,930

7

0

Showing 10 of 10 posts

No more posts