🚀 Day 46 of #100DaysOfCode Today I tackled one of the classic C programming challenges: Matrix Multiplication 💥 🔢 The program takes two square matrices of size n × n as input from the user, multiplies them using nested loops, and outputs the resulting matrix. I used Variable Length Arrays (VLAs) for dynamic sizing and implemented the standard multiplication logic: 🧠 This challenge helped reinforce: Loop nesting for multidimensional arrays Matrix indexing logic Clean, symmetric output formatting for better readability 📸 I’ve kept the output structured for easy sharing and future upgrades (thinking about adding grid-style display or color-coded elements next!). 💡 Code Concepts Covered Dynamic matrix allocation User input handling Matrix multiplication algorithm Output formatting 🔧 Next Steps Thinking of adding: Input validation Grid-style matrix display Support for non-square matrices 🔗 Hashtags #Day46 #100DaysOfCode #CProgramming #CodeNewbie #LearnToCode #CodingChallenge #ProblemSolving #CodeDaily #ProgrammingInC kirti singh
More Relevant Posts
-
💡 Exploring Memory and Arrays in C Today, I explored how arrays, pointers, and memory work in the C programming language. Even though I usually work with high-level systems, diving into low-level concepts gave me a deeper understanding of how computers actually handle data in memory. Here’s what I practiced: • Using typedef to define fixed-size data types (b8, b16, b32) • Declaring and initializing arrays • Printing values and memory sizes with printf() • Exploring how pointers move across memory (int *p = stack + pc;) • Understanding what happens when you go beyond array boundaries — and why that can lead to undefined behavior It was a fun reminder that all high-level programming builds on these low-level principles. Learning C definitely sharpens your thinking about how data actually flows in a program! 🔹 #CProgramming #LearningJourney #SoftwareDevelopment #MemoryManagement #ProgrammingBasics #LinkedInLearning
To view or add a comment, sign in
-
-
🚀 C Programming Challenge – Program #2: Temperature Converter 🌡️ Today’s mini project is all about temperature conversion — a simple yet practical exercise for mastering functions, loops, and conditional logic in C. 💡 What this program does: It allows the user to choose between three types of conversions: 1️⃣ Celsius → Fahrenheit 2️⃣ Celsius → Kelvin 3️⃣ Fahrenheit → Kelvin The program validates the user’s input using a while loop to ensure only valid choices (1–3) are accepted. Then, it performs the correct calculation using separate functions — a clean and modular approach that strengthens understanding of function-based design in C. 🔥 Concepts practiced: Function declarations and definitions Switch statements Input validation using loops Floating-point arithmetic Each small project like this helps build strong problem-solving habits and coding discipline — one program at a time. 💪 #CProgramming #CodingJourney #100DaysOfCode #LearnToCode #ProgrammingChallenge #SoftwareDevelopment #CodeInC
To view or add a comment, sign in
-
-
💻 Day 7 of My 30-Day Embedded C Programming Challenge 🧩 Question of the Day: Write a program to concatenate two strings — a common interview question in C programming. 💡 Concepts Covered: Manual string manipulation in C Array indexing and memory handling Understanding null termination in strings Handling alphabetic and numeric inputs ⚙️ Approach I Used: Took two strings as input from the user. Used a loop to find the end of the first string. Appended the second string character by character to the first string. Ensured the final string was properly null-terminated. Did not use any standard library functions like strcat() or strlen(). 📘 Key Learning: This exercise reinforced my understanding of how strings are stored in memory, how concatenation works internally, and how to perform manual string operations safely using array indexing. ✅ Output Example: Enter first string: Hello Enter second string: World Concatenated string: HelloWorld #30DayCodingChallenge #EmbeddedC #CProgramming #StringManipulation #MemoryManagement #CodeEveryday #InterviewPrep #LearningJourney
To view or add a comment, sign in
-
-
n this program, I used a while loop to print numbers from 1 to 10 on the screen. 🎯 It’s a simple example but a great way to understand how loops work in C programming — they help us repeat actions automatically without writing the same line again and again! 🔁 ✨ Concepts Used: ➡️ Variable initialization (n = 1;) ➡️ Loop condition (n <= 10) ➡️ Increment operator (n++) ➡️ Output using printf() Every small program is a step toward writing bigger logic and better code! 🚀 #CProgramming #CodingPractice #WhileLoop #ProgrammingBasics #CodeJourney #LearningByDoing 💻
To view or add a comment, sign in
-
-
🚀 Arrays in C++: Static Memory Allocation Arrays in C++ are fundamental data structures used to store collections of elements of the same data type. Their key characteristic is static memory allocation, meaning the size of the array must be known at compile time. This is crucial in C++ because memory management is explicit. Understanding array bounds and potential buffer overflows is vital for writing safe and efficient C++ code. Arrays provide direct access to elements via their index, allowing for fast retrieval and modification. #c++ #programming #coding #tech #learning #professional #career #development
To view or add a comment, sign in
-
-
🚀 String Substrings in C++ Extracting substrings from a C++ string is done using the `substr()` method. This method takes two arguments: the starting position of the substring and the length of the substring. If the length is not specified, the substring extends to the end of the string. It's important to ensure that the starting position and length are within the bounds of the string to avoid errors. `substr()` creates a new string object containing the extracted substring. #c++ #programming #coding #tech #learning #professional #career #development
To view or add a comment, sign in
-
-
Day Two: Diving Deeper into C – The Power of Precision and Pointers 🚀 Day 2 of my deep dive into C programming was incredibly productive, spanning three critical areas that enhance control and precision in low-level development. Boolean Logic: Successfully implemented bool functions to handle clear, concise True/False logic. This is key for creating highly readable and efficient decision-making structures within programs. String Manipulation: Explored the mechanics of using multiple arrays of characters (the C way of handling strings). Understanding how to organize and access collections of character data is fundamental for text processing. Pointers Unlocked: Built directly on Day 1's foundation by learning the practical application of Pointers. This exercise truly demonstrated how storing and manipulating the address of a variable allows for powerful, dynamic control over memory. Connecting these concepts reveals the true power of C: the ability to manage data types, logic, and memory with absolute precision. 💡 Next Goal: I'm already working on it 🚀! #CProgramming #Pointers #DataStructures #LowLevelProgramming #LearningInPublic #Day2 #ImanLearns
To view or add a comment, sign in
-
-
🚀 String Views in C++17 and Beyond C++17 introduced `std::string_view`, a non-owning reference to a contiguous sequence of characters. `std::string_view` provides a way to access string data without copying it, improving performance and reducing memory usage. It can be used with both `std::string` objects and C-style strings. `string_view` objects are lightweight and efficient for read-only access to string data. They avoid unnecessary allocations and copies. Learn more on our website: https://techielearns.com #c++ #programming #coding #tech #learning #professional #career #development
To view or add a comment, sign in
-
-
#Day_110/160 – GFG Problem Solving Challenge Problem: Longest String Chain Topic: Dynamic Programming + Sorting Today I worked on a problem where we need to determine the longest possible chain of words such that each word can be formed by adding exactly one character to the previous word without disturbing the character order. Key Idea: Sort the words based on length. For each word, generate all possible predecessor words by removing one character. Use a hash map to store the longest chain ending at each word. Update the maximum chain length dynamically. Takeaway: This problem reinforced how dynamic programming can be applied effectively on strings. Instead of comparing every pair of words, generating possible predecessors provides a much more efficient solution and fits well within constraints. On to Day 111. #GFG #ProblemSolving #CodingChallenge #DynamicProgramming #C++
To view or add a comment, sign in
-
Explore content categories
- Career
- Productivity
- Finance
- Soft Skills & Emotional Intelligence
- Project Management
- Education
- Technology
- Leadership
- Ecommerce
- User Experience
- Recruitment & HR
- Customer Experience
- Real Estate
- Marketing
- Sales
- Retail & Merchandising
- Science
- Supply Chain Management
- Future Of Work
- Consulting
- Writing
- Economics
- Artificial Intelligence
- Employee Experience
- Workplace Trends
- Fundraising
- Networking
- Corporate Social Responsibility
- Negotiation
- Communication
- Engineering
- Hospitality & Tourism
- Business Strategy
- Change Management
- Organizational Culture
- Design
- Innovation
- Event Planning
- Training & Development