SoftwareMill’s Post

Day 31- What I Learned In a Day(JAVA) Today, I learned about nested for loops and how they are used in pattern programming. A nested loop is simply a loop inside another loop. The outer loop controls the number of rows, while the inner loop controls what gets printed in each row (columns). 🔹 Outer loop → runs row by row 🔹 Inner loop → runs completely for each row 🔹 This helps in creating patterns like squares, triangles, and pyramids For every single iteration of the outer loop, the inner loop executes fully this is the key idea behind pattern problems. Understanding this concept improved my ability to break down problems step by step and visualize output clearly. I Practiced 16 Patterns 👇 #Java #Programming #Coding #LearningJourney #NestedLoops #PatternProgramming

🚀 Day 7 – Inheritance in Java Today I learned about Inheritance, one of the core pillars of Object-Oriented Programming. Inheritance allows one class to acquire the properties and methods of another class using the extends keyword. It helps in: 🔹 Code reusability 🔹 Reducing redundancy 🔹 Creating logical class relationships For example, I created a base class and extended it to a child class to understand how methods and variables are inherited and reused. This concept made me realize how real-world applications are structured efficiently using OOP principles. Slowly moving from writing programs → to understanding software structure 💻 #Java #OOP #Inheritance #Day7 #LearningInPublic #ComputerScience

🚀 Day - 24/100 : 📌 Problem : Binary Number with Alternating Bits 🔗 Problem Link : https://lnkd.in/gCDJXjEK 💡 Approach The goal is to check whether adjacent bits in the binary representation are different (i.e., 101010... pattern). Extract the last bit of the number using n & 1. Right shift the number using n >> 1 to move to the next bit. Again extract the next bit using n & 1. Compare the two bits: If they are equal, the number does not have alternating bits → return false. Continue this process until all bits are checked. If no two adjacent bits are the same, return true. #100DaysOfLeetCode #LeetCode #DSAWithKunal #Algorithms #Java #BitManipulation #CodingPractice #ProblemSolving #DeveloperJourney #Programming

🔹 Reverse Number in Java – Logic + Implementation Strong fundamentals are key to becoming a better developer. This example demonstrates how to reverse a number using simple mathematical operations: • Extract last digit using modulus (%) • Build the reversed number step by step • Reduce the number using division (/) Such problems help improve logical thinking and coding efficiency. 🎥 I’ve also created a short video explaining this concept with code: YouTube link : https://lnkd.in/gfaafZWZ #Java #Programming #ProblemSolving #Coding #SoftwareDevelopment #Learning

Day 13 of Programming - Array Pairs Today I explored an interesting concept in arrays: Array Pairs. In many programming problems, we often need to find pairs of elements in an array that satisfy a certain condition. Working with pairs helps improve problem-solving skills and strengthens understanding of loops and array traversal. 🔹 What are Array Pairs? Array pairs are combinations of two elements taken from an array. By comparing these pairs, we can solve various logical problems. 📌 Problems I Practiced Today: • Finding all possible pairs in an array • Finding pairs with a given sum • Finding pairs with maximum difference • Finding pairs with minimum difference • Finding duplicate pairs in an array • Counting the total number of pairs #Day13 #ProgrammingJourney #Java #Arrays #CodingPractice #ProblemSolving #LearnToCode

Over the past semester I focused on building a strong foundation in Object-Oriented Programming with Java by consistently practicing and organizing my work in a structured way. I organized my practice into a structured repository covering core concepts such as classes, inheritance, polymorphism, abstraction, and object relationships, along with hands on assignments, problem sets, and small GUI-based implementations. Maintaining this structure helped reinforce clarity in thinking, improve code organization, and develop better problem solving habits. Repository: https://lnkd.in/d9reDSjK #Java #OOP #SoftwareEngineering #ComputerScience #Programming

PROBLEM #10 ⚡ , MOVE ZEROES, in #leetcode by using two pointer method. swapping the non zeroes to the left and the zeroes to the right. time complexity - o(n); #problemsolving #dsa #arrays #geeksforgeeks #java #programming #computerscience #developer #datastructuresandalgorithms

🔁 Recursion Made Simple When a function calls itself — that’s Direct Recursion. When it calls another function that calls it back — that’s Indirect Recursion. 💡 Example: Factorial of 6 6 × 5 × 4 × 3 × 2 × 1 = 720 Base Case ➝ Stops the recursion Recursive Call ➝ Breaks problem into smaller parts Think smaller. Solve smaller. Build bigger. 🚀 #Java #Recursion #Programming #CodingLife #DataStructures #LearnToCode

🚀 Day 85 of #100DaysOfCode Today I practiced a simple yet useful array prefix minimum problem. 🔹 Problem Given an array cost, return a new array where each element represents the minimum cost encountered from the start up to that index. 🔹 Approach I used a running minimum technique: Maintain a variable min to track the smallest value seen so far. Traverse the array. Update min using Math.min(min, cost[i]). Store the current minimum in the result array. 🔹 Time Complexity ⏱ O(n) – Single pass through the array. 🔹 Space Complexity 📦 O(n) – For storing the result array. 🔹 Key Learning This is a classic prefix computation pattern where we keep track of information while traversing the array. #DSA #Java #Programming #CodingJourney #100DaysOfCode #SoftwareEngineering