Java Inheritance Explained with Medical Analogy

Built a Java program to classify user input 💻 Used Scanner for taking input from user. Extracted character using charAt(0). Checked if input is alphabet, digit, or special character. Handled both uppercase and lowercase cases. Applied if-else logic effectively. Improved understanding of Java fundamentals. Practiced clean and structured coding. Strengthening logic building step by step 🚀 Consistency leads to better problem-solving skills 🔥 #Java #JavaProgramming #CodingJourney #LearnToCode #StudentDeveloper #ProgrammingBasics #LogicBuilding #TechSkills #VSCode #100DaysOfCode

🚀 DSA in Java – Day 76 ✅ Today I solved the “Check if Binary String Has at Most One Segment of Ones” problem on LeetCode. 💡 Problem Idea: Given a binary string, we need to check whether there is at most one continuous segment of '1's in the string. 🧠 Approach: Traverse the string using a loop. Count how many segments of '1' appear. If the count becomes greater than 1, return false. Otherwise return true. ⚡ Key Concepts Practiced: String traversal While loop Character comparison Logical conditions Consistency in solving problems every day is helping me strengthen my problem-solving and logical thinking skills in Java. #DSA #Java #LeetCode #ProblemSolving #CodingJourney #WomenInTech #100DaysOfCode

Today I solved “Fibonacci Number” on LeetCode using Java. 💡 Problem Summary The Fibonacci sequence is defined as: F(0) = 0 F(1) = 1 F(n) = F(n-1) + F(n-2) We need to compute F(n). 🧠 Approach I Used (Iterative Optimization) Instead of recursion (which is slow and redundant), I used an iterative approach: Maintain two variables → previous two values Keep updating them in a loop Build the answer step by step ⚙️ Why Not Recursion? Recursion leads to repeated calculations Time complexity becomes O(2ⁿ) ❌ Iterative solution reduces it to O(n) ✅ 📊 Complexity Analysis ⏱️ Time Complexity: O(n) 📦 Space Complexity: O(1) ⚡ Result ✅ Accepted ⚡ Runtime: 0 ms (Beats 100%) 📚 Key Learning Always try to optimize recursion → iteration Use variables smartly to reduce space Even simple problems teach important optimization patterns Slowly building strong fundamentals, one problem at a time 💯 Day 15 done. Let’s keep the streak alive 🔥 #DSA #LeetCode #Java #100DaysOfCode #Algorithms #ProblemSolving #CodingJourney #Consistency #LearningInPublic

Entry-level Algorithm Challenge: Array Manipulation in Java. Today I tackled a foundational exercise: reading a list of numbers and filtering out only the negative values. It was a great opportunity to reinforce some core Java concepts: 1. Flow control with do-while loop: Ensuring valid input within a specific range. 2. Simplified iteration with for-each loop: Improving code readability. 3. Handling flags (boolean signals): Providing clear, user-friendly feedback. Check out the logic below! 👇 #Java #Algorithms #SoftwareDevelopment #Coding

🚀 Day 30 / 180 – DSA with Java 🚀 📘 Topic Covered: Strings & Sorting Technique 🧩 Problem Solved: Longest Common Prefix Problem: Given an array of strings, find the longest common prefix shared among all the strings. Approach: Sorted the array of strings and compared only the first and last strings. Since sorting groups similar prefixes together, the common prefix between these two strings represents the common prefix for the entire array. Key Learning: ✔️ Using sorting to simplify string comparison problems ✔️ Observing patterns to reduce unnecessary checks ✔️ Efficient prefix detection in string arrays If you’re also preparing for DSA, let’s connect and learn together 🤝 #DSA #Java #180DaysOfCode #LearningInPublic #Strings #ProblemSolving #Consistency 

Recently, I revised some core Java concepts, and honestly, things started making more sense when I connected them practically. Polymorphism was one of the interesting parts. Method overloading happens at compile time, where the compiler already knows which method to call. But method overriding is different — the JVM decides at runtime, which makes it more dynamic. That’s where I understood the idea of early binding and late binding. Early binding is fixed during compilation, while late binding happens when the program is actually running. Dynamic method dispatch is just this in action — the JVM figuring out which method to execute based on the object. I also revised relationships in OOP. Inheritance follows an “is-a” relationship, like a cargo plane is a plane. Association is more of a “has-a” relationship, and it can be either strong (composition) or loose (aggregation). And one thing that helped me connect everything — Java code first becomes bytecode, and then JVM runs it. That’s where all the runtime decisions happen. Revisiting basics really helps in understanding how things actually work behind the scenes. #Java #OOP #Learning #CodingJourney

💡 Understanding the Diamond Problem in Multiple Inheritance In Object-Oriented Programming, multiple inheritance allows a class to inherit from more than one parent class. But this can introduce a serious problem called the Diamond Problem. Imagine this inheritance structure: Class A / \ Class B Class C \ / Class D Both Class B and Class C inherit from Class A and override the same method show(). Example: class B extends A { void show() { System.out.println("B"); } } class C extends A { void show() { System.out.println("C"); } } Now when Class D inherits from both: D obj = new D(); obj.show(); Which method should run? B.show() C.show() This creates ambiguity because the compiler cannot determine which method implementation to use. To avoid this confusion, Java does NOT support multiple inheritance with classes. Instead, Java allows multiple inheritance through interfaces, where the implementing class explicitly defines the behavior. Understanding these design decisions helps us appreciate why Java prioritizes clarity, simplicity, and maintainability. #Java #ObjectOrientedProgramming #OOP #JavaDeveloper #SoftwareEngineering #ProgrammingConcepts #Coding #ComputerScience #LearnToCode #TechEducation:

🔁 Same method name… different behaviors. That’s the power of Method Overloading in Java. In today’s Core Java session, we explored how Java supports compile-time polymorphism by allowing multiple methods with the same name but different parameter lists. What seemed confusing at first became crystal clear through real-time coding and practical implementation under the guidance of Sharath R Sir at TAP Academy 💡 What I learned today: ⚙️ What compile-time polymorphism really means 🧩 Changing number, type & order of parameters 📌 How the compiler decides which method to execute 🚀 Writing cleaner, reusable, and structured code Instead of creating multiple method names, overloading helps maintain flexibility while keeping the code clean and readable. Every concept is adding one more strong brick to my Core Java & OOP foundation.🔥 Bibek Singh #Java #CoreJava #OOP #MethodOverloading #Polymorphism #FullStackDeveloper #LearningJourney #TapAcademy

Today I Learned – Object Orientation Rules & Main Method in Java While learning Java, I explored how object relationships work and how a program starts execution. --> HAS-A Relationship Represents composition or aggregation, where one class contains another class object as a member. Example: Car HAS-A Engine --> DOES-A Relationship Represents behavior implementation, where a class performs behavior defined by another type using interfaces or abstract classes. Example: Bird DOES-A Flyable --> Main Method in Java The entry point of a Java application where the Java Virtual Machine starts program execution. Syntax: public static void main(String[] args) Breakdown: • public → Accessible everywhere • static → Can be executed without creating an object • void → Does not return a value • main → Method recognized by JVM to start execution • String[] args → Used to receive command-line arguments #JavaDeveloper #ObjectOrientedProgramming #OOP #JavaLearning #BackendDevelopment #CodingJourney #100DaysOfCode #LearningInPublic #DeveloperCommunity #FutureDeveloper #TechCareer

Refactoring for Clarity: Array Manipulation in Java 👨💻 I’ve just finished a practical exercise on array manipulation. While the goal was simple (summing two arrays), I used it as an opportunity to apply improvements. - Method decomposition: Separated concerns into specialized methods (Read, Calculate, Display). - Input validation: Built a robust loop to handle invalid inputs and prevent crashes. - Data Formatting: Used printf to create a clear, readable results table. Small improvements in logic and organization make a huge difference in software quality. #Java #Algorithms #CleanCode #Backend #LearningToCode