Cognizant GenC Campus Recruitment | 4.5 LPA | 2021 Batch | Last date - 11 June

bit.ly/3ilbttQ

~via PrepFlix
Telegram - @programming_and_coding

Walmart Off Campus | 2021 & 2022 Batch | Last Date - 11 June | Cash Prize + CTC upto 26lpa

dare2compete.com/o/walmart-codehers-walmart-india-pvt-ltd-167089

Telegram - @programming_and_coding

DOVER Hiring Software Engineer | 2020 Batch | 6.5LPA

firstnaukri.com/job-listings-software-engineer-jobs-in-Bengaluru-Bangalore-in-DOVER-INDIA-PRIVATE-LIMITED-170621600028

Telegram - @programming_and_coding

BLUJAY is Hiring | 2021 Batch | 4.5LPA

bit.ly/3wJj7CG

Telegram - @programming_and_coding

https://link.upstox.com/SeFm

Download upstox and create your account to earn 50k to 60k with study .

https://link.upstox.com/SeFm

Happy diwali everyone 🎆

Hi! I use CoinDCX app to invest in Bitcoin. Use my invite link to download the app & get ₹100 Free Ethereum when you make your first investment - https://join.coindcx.com/invite/NJFt

5 Million+ Indians use CoinDCX for their cryptocurrency investments. It's safe, secure and BitGo Insured.

114. Program to delete given number from array.

#include<stdio.h>
#include<conio.h>

void main()
{
int array[10];
int i, n, pos, element, found = 0;
clrscr();

printf("Enter total number of elements : ");
scanf("%d", &n);
printf("\nEnter the elements : \n");

for (i = 0; i < n; i++)
{
scanf("%d", &array[i]);
}

printf("Input array elements are\n");

for (i = 0; i < n; i++)
{
printf("\n%d", array[i]);
}

printf("\nEnter the element to be deleted : ");

scanf("%d", &element);

for (i = 0; i < n; i++)
{
if (array[i] == element)
{
found = 1;
pos = i;
break;
}
}

if (found == 1)
{
for (i = pos; i < n - 1; i++)
{
array[i] = array[i + 1];
}

printf("\nResultant array elements are : ");

for (i = 0; i < n - 1; i++)
{
printf("\n%d", array[i]);
}
}
else
{
printf("\nElement %d is not found in the array", element);
}
getch();
}
@programming_and_coding

*Looking for one app to research, analyse, invest? Join Upstox!*

Opening an Upstox account is easy-peasy. All you need is your PAN + Aadhaar. You can sign-up online using my link within the next 7 days: https://link.upstox.com/SeFm

🛒 Upstox makes investing fun and it feels just like online shopping!

💸 With special filters + smartlists they make the search for the right investment simple

💰 They’ve got SIP modes for both Mutual Funds & Stocks

📰 They’re easy to understand with news, research & insights on all investments

📈 And have a separate app for traders with TradingView, GTT orders, Option Chain

*P.S. Sign up with a number not registered with Upstox before. Can’t wait to welcome you to the Upstox fam👋!*

🚀 Elevate Your Coding Skills with C Language! 🌐

Join our Telegram Channel dedicated to all things C programming! 🤖💻
@programming_and_coding

🔍 What's in Store?
- Learn the fundamentals and advanced concepts of C.
- Explore real-world coding examples and projects.
- Stay updated with the latest trends and best practices.

👥 Connect with a Community of Coders:
- Engage in discussions with fellow C enthusiasts.
- Share your knowledge and learn from others.
- Collaborate on exciting coding challenges.

🚨 Don't Miss Out:
Whether you're a beginner or an experienced developer, our channel has something for everyone! 🚀

📌 Join Now: @programming_and_coding

Unlock the power of C programming and take your coding journey to new heights! 🚀💡 #CLanguage #CodingCommunity #LearnToCode

🚀 **Code Challenge
#115: Mastering Pointers in C!**

Hey Coders! 👩‍💻👨‍💻

Let's dive into the world of pointers with today's challenge! 🎯


#include <stdio.h>

int main() {
// Declare an integer variable
int num = 42;

// Declare a pointer and point it to the address of 'num'
int *ptr = &num;

// Modify the value using the pointer
*ptr += 8;

// Print the updated value
printf("The new value of num is: %d\n", num);

return 0;
}


🤔 Challenge Task:
1. Understand how the pointer ptr is initialized.
2. Use the pointer to increment the value of num by 8.
3. Print the updated value of num.

💡 Hint: Remember to dereference the pointer using * to access and modify the value it points to.

Happy coding! 🚀💻 #CodeChallenge #CProgramming #PointersInC
Share it your friends and family.

@programming_and_coding

🚀 Code Challenge #115: Array Manipulation in C!

Hello Coders! 👩‍💻👨‍💻

Let's continue our coding journey with today's challenge – Manipulating Arrays! 🌐🔍

116: Remove Duplicates from Array


#include<stdio.h>
#include<conio.h>

void main()
{
int array[10];
int i, n, pos, element, found = 0;
clrscr();

printf("Enter total number of elements : ");
scanf("%d", &n);
printf("\nEnter the elements : \n");

for (i = 0; i < n; i++)
{
scanf("%d", &array[i]);
}

printf("Input array elements are\n");

for (i = 0; i < n; i++)
{
printf("\n%d", array[i]);
}

printf("\nEnter the element to be deleted : ");

scanf("%d", &element);

for (i = 0; i < n; i++)
{
if (array[i] == element)
{
found = 1;
pos = i;
break;
}
}

if (found == 1)
{
for (i = pos; i < n - 1; i++)
{
array[i] = array[i + 1];
}

printf("\nResultant array elements are : ");

for (i = 0; i < n - 1; i++)
{
printf("\n%d", array[i]);
}
}
else
{
printf("\nElement %d is not found in the array", element);
}
getch();
}


🤔 Challenge Task:
Modify the provided code to remove duplicates from the array and display the result.

Share with your friend
@programming_and_coding
Happy coding! 🚀💻 #CodeChallenge #CProgramming #ArrayManipulation

🚀 Code Challenge #116: Searching in a Sorted Array

Hello, Coding Enthusiasts! 👩‍💻👨‍💻

Dive into today's challenge focused on searching in a sorted array! 🔍🌐

Question 116: Binary Search in a Sorted Array


#include <stdio.h>

int binarySearch(int array[], int low, int high, int target) {
while (low <= high) {
int mid = low + (high - low) / 2;

if (array[mid] == target)
return mid;

if (array[mid] < target)
low = mid + 1;
else
high = mid - 1;
}

return -1; // Target not found
}

int main() {
int array[] = {2, 5, 8, 12, 16, 23, 38, 42, 56, 72};
int n = sizeof(array) / sizeof(array[0]);
int target = 23;

int result = binarySearch(array, 0, n - 1, target);

if (result != -1)
printf("Element %d found at index %d", target, result);
else
printf("Element %d not found in the array");

return 0;
}

🤔 Challenge Task:
1. Understand the provided binary search algorithm.
2. Execute the algorithm to find the index of the target element (e.g., 23) in the sorted array.

Happy coding! 🚀💻
Join us on [Telegram](https://t.me/programming_and_coding) for more coding discussions and challenges! #CodeChallenge #CProgramming #BinarySearch

🚀 Coding Chronicles #117: Unleashing the XOR Swap Magic!

Hello, Coding Maestros! 👩‍💻👨‍💻

Let's delve into a byte-sized piece of coding wisdom today! 🧠✨

🌐 The Magic of Bit Manipulation: Swapping Variables

#include <stdio.h>

void swap(int *a, int *b) {
    *a = *a ^ *b;
    *b = *a ^ *b;
    *a = *a ^ *b;
}

int main() {
    int x = 10, y = 20;

    printf("Before Swap: x = %d, y = %d\n", x, y);
    
    swap(&x, &y);

    printf("After Swap: x = %d, y = %d\n", x, y);

    return 0;
}

🤯 Insight:
Ever heard of swapping variables without a temporary variable? Bit manipulation does the trick! Explore the XOR swap algorithm in this compact code snippet.

💡 Key Takeaway:
Understanding the power of bitwise operations opens doors to efficient coding solutions!

🚀💻 Join our community on [Telegram](https://t.me/programming_and_coding) for more coding adventures! #CodingWisdom #BitManipulation #ProgrammingJourney

🚀 Tech Talk #118: The Art of Debugging

Hello, Tech Enthusiasts! 👩‍💻👨‍💻

Let's dive into the art of debugging – a skill every coder should master! 🛠️✨

🕵️ What is Debugging?
Debugging is like solving a puzzle. It's the process of identifying and fixing issues in your code. Here are some tips to level up your debugging game:

1. Print Statements are Your Friends:
- Strategically place print statements to trace the flow of your code.
- Outputting variable values helps understand their states.

2. Rubber Duck Debugging:
- Explain your code problem to an inanimate object or a rubber duck.
- This technique often leads to self-realization of the issue.

3. Use Debugging Tools:
- Familiarize yourself with IDE debuggers and tools like gdb for C.
- Set breakpoints and step through your code to catch bugs in action.

4. Binary Search for Bugs:
- Divide and conquer – narrow down the section where the bug exists.
- Isolate the problem area before delving into the details.

🚀 Level Up:
Embrace debugging as a crucial part of your coding journey. It's not just about fixing errors; it's about understanding your code deeply.

💡 Share Your Tips:
What's your favorite debugging technique? Share your insights with your friends! 🚀💬 Join our community on [Telegram](https://t.me/programming_and_coding) for more tech talks and coding discussions! #TechTalk #DebuggingMasters #CodingTips

🚀 Tech Insight #119: The Power of Recursion

Hello, Code Enthusiasts! 👩‍💻👨‍💻

Let's unravel the mystical realm of recursion today! 🌀✨

🔄 What is Recursion?
Recursion is a programming concept where a function calls itself in its own definition. It's a powerful technique that can simplify complex problems.

🌐 Fibonacci Sequence using Recursion in C:

#include <stdio.h>

int fibonacci(int n) {
if (n <= 1)
return n;
return fibonacci(n - 1) + fibonacci(n - 2);
}

int main() {
int n = 5;
printf("Fibonacci sequence up to %d terms:\n", n);
for (int i = 0; i < n; i++) {
printf("%d ", fibonacci(i));
}
return 0;
}


🤔 Why Recursion?
1. Elegant Solutions: Certain problems are naturally expressed using recursion, making the code more elegant.
2. Divide and Conquer: Recursive solutions often follow a divide-and-conquer approach, breaking down problems into smaller, more manageable subproblems.

💬 Let's Discuss with your friends:
Share your thoughts on recursion! Do you find it fascinating or challenging? Have you encountered situations where recursion was the key to a solution?

Join the conversation on [Telegram](https://t.me/programming_and_coding) and let's explore the recursive wonders together! 🚀🗣️ #RecursionMagic #TechInsights #CodingExploration