Java Methods for Beginners: equals, hashCode, toString, and more

✨ Day 74 of #100DaysOfCode Today, I solved LeetCode 22. Generate Parentheses using Backtracking in Java 🧠💻 📝 Problem Summary: Given n pairs of parentheses, generate all combinations of well-formed parentheses. ✅ Example: Input: n = 3 Output: ["((()))","(()())","(())()","()(())","()()()"] 💡 Key Idea: Use backtracking to build all valid strings. Keep track of the number of opening and closing brackets. Add '(' if open < n. Add ')' if close < open. When the string reaches length 2 * n, it's a valid combination. 🚀 Learning: Backtracking is a powerful technique for exploring all valid combinations. Keeping proper state (open, close) helps prune invalid paths early. #100DaysOfCode #LeetCode #DSA #Java #ProblemSolving #Backtracking #CodingChallenge #SowmiyaCodes #PlacementPrep

💡 Pillars of Object-Oriented Programming (OOP) 💻 🔹 Encapsulation – Protects data through data hiding and keeps implementation details private. 🔹 Inheritance – Enables code reusability by allowing new classes to inherit properties and methods from existing ones. 🔹 Polymorphism – Allows methods to behave differently based on the object (through overloading and overriding). 🔹 Abstraction – Focuses on essential details using abstract classes and interfaces, hiding unnecessary complexity. #OOP #Java #ProgrammingConcepts #SoftwareDevelopment #Learning

🚀 Day 18/100 of #100DaysOfCode ✅ Solved “Isomorphic Strings” (LeetCode #205) using Java! 🧩 Problem: Given two strings s and t, determine if they are isomorphic. 👉 Two strings are isomorphic if characters in one string can be replaced to get the other — while keeping order and unique mapping intact. 🧠 Approach: Used a HashMap to store the mapping of characters from s → t. Checked if each character in s has a consistent mapping in t. Also ensured that no two characters in s map to the same character in t. ✨ Example: s = "egg", t = "add" → true (e→a, g→d) s = "foo", t = "bar" → false 📈 Complexity: Time: O(n) Space: O(n) 💡 Key Learnings: Understood how to maintain one-to-one character mapping using a HashMap. Reinforced logic building for pattern matching between strings. 💻 Tech Used: Java | HashMap | Problem Solving #LeetCode #100DaysOfCode #Java #ProblemSolving #DSA #CodingJourney #LearnByDoing #DevCommunity

Day 80 of #100DaysOfCode Solved Frequency Sort in Java 🔠 Approach Today's problem was to sort an array based on the frequency of its numbers. My initial solution was accepted, but it exposed a major efficiency gap! My strategy involved: Sorting the array first. Using nested loops to count the frequency of each number and store it in a HashMap. (Implied) Using the counts to perform the final custom sort. The core issue was the counting method: running a full loop inside another full loop to get the frequency. This quadratic $O(N^2)$ counting completely tanked the performance. ✅ Runtime: 29 ms (Beats 12.02%) ✅ Memory: 45.26 MB (Beats 5.86%) Another great lesson in algorithmic complexity! The difference between $O(N^2)$ and the optimal $O(N \log N)$ for this problem is massive. Time to refactor and implement the fast, single-pass $O(N)$ frequency count using getOrDefault! 💪 #Java #100DaysOfCode #LeetCode #CodingChallenge #Algorithms #Arrays #HashMap #Optimization #ProblemSolving

🌟 Exploring getMessage(), e, and printStackTrace() in Java Exceptions: 🧠Today, I explored how Java helps developers understand and debug errors effectively using three key exception-handling tools. ✨ Here’s What I Learned: 💡 getMessage() Returns a short, descriptive message about what went wrong - e.g., “File not found” or “Invalid input.” Helps quickly identify the error cause and is great for user-friendly or logged messages. 💡 e (Exception Object) The catch block receives an exception object (commonly e) that holds all error details. Through e, we can call getMessage() or printStackTrace() to analyze the issue. 💡 printStackTrace() Displays the full execution path where the exception occurred - class, method, and line number. Best for debugging during development; in production, structured logs are preferred. ✨ In Simple Terms: getMessage() → tells why the error happened. e → stores what the error is. printStackTrace() → shows where it happened. #Java #LearningJourney #ExceptionHandling #getMessage #printStackTrace #Programming 

#Day 3 of the Coding Challenge: The Missing Number! Today, I cracked a classic array problem: Finding the Missing Number in an array containing n distinct numbers from the range [0, n] My final, optimized solution uses the elegant Gauss Summation method with a crucial twist to avoid a common pitfall! # The Problem & The Solution Input: An array nums of length n (e.g., [3, 0, 1]). The numbers are from 0 to n(e.g., 0, 1, 2, 3). Missing Number: 2. Logic: {Missing Number} = {Expected Sum of } 0 { to } n) - ({Actual Sum of Array Elements}) 👨💻 My Optimized Java Code Java class Solution { public int missingNumber(int[] nums) { int n = nums.length; // CRITICAL FIX: Use 'long' for the expected sum calculation // to prevent Integer Overflow for large 'n'. long expectedSum = (long)n * (n + 1) / 2; long actualSum = 0; for(int num : nums){ actualSum += num; } return (int) (expectedSum - actualSum); } } ? Why the long is Key to Optimization While the O(n) summation method is fast, the intermediate value of frac{n(n+1)}{2}can easily exceed Integer.MAX_VALUE if the array is large (around n=65,536). By casting to long, we make the solution robust and production-ready, eliminating the risk of a bug under large constraints! ❓ Quick Poll: Which O(n) method do you prefer for this problem? Gauss Summation (Like above - Math is power!) Bitwise XOR (The clever one that avoids all addition!) Let me know your vote and why in the comments! 👇 #Day3 #CodingChallenge #LeetCode #Java #Programming #Algorithm #DataStructures #TechJobs #SoftwareDevelopment

🚀Day 53 #180daysofconsistency Deep Dive into Exception Handling, Java & Python ⚙️ Before exceptions, developers used return codes, global flags, and manual clean-ups, which often led to messy code, missed errors, and resource leaks. In this part, I explored how exception handling revolutionized modern programming by making our code: ✅ Cleaner — separates normal logic from error logic ✅ Safer — ensures automatic clean-up using try-with-resources (Java) and with (Python) ✅ Smarter — propagates context to where recovery actually makes sense 🔹 Java Focus: try, catch, finally, throws, and best practices like multi-catch & specific exception handling. 🔹 Python Focus: try, except, else, finally, raise, and Pythonic EAFP (“Easier to Ask Forgiveness than Permission”). 🔹 Key Lesson: Catch only what you can fix; let it crash safely when you can’t. 📘 Full guide PDF: Exception Handling in Java & Python , A Deep, Engineer-Friendly Guide Thank you to algorithms365 and Under the Guidance of Mahesh Arali Sir 🙏🏻 🧑💻 #Java #Python #DSA #ExceptionHandling #CleanCode #SoftwareEngineering #LearningJourney

💻 Weekend Experiment: Javelit + LangChain4j + Ollama + BraveSearchMCP This weekend, I came across #Javelit — an open-source UI framework for #Java, inspired by Python’s Streamlit. It enables developers to quickly build interactive web apps directly in Java, without any frontend setup. To explore its potential, I built a small AI Chatbot using: 🧠 LangChain4j for LLM orchestration 🦙 Ollama as the local inference backend ☕ Javelit for the UI layer 🌐 Brave Search MCP for real-time web information retrieval The result is a fully local AI chat app, running end-to-end on the JVM — capable of mixing local reasoning with live search results. Perfect for quick prototypes, PoCs, or internal tools. You can check out the source code here: 🔗 https://lnkd.in/dBY5pYj9

Day 85 of #100DaysOfCode Solved Range Sum Query - Immutable (NumArray) in Java ➕ Approach Today's problem was a classic that demonstrates the power of pre-computation: finding the sum of a range in an array many times. The optimal solution is the Prefix Sum technique. Pre-computation: In the constructor, I built a prefixSum array where prefixSum[i] holds the sum of all elements from index 0 up to index $i-1$ in the original array. This takes $O(N)$ time. $O(1)$ Query: The magic happens in the sumRange(left, right) method. The sum of any range $[left, right]$ is found instantly by calculating prefixSum[right + 1] - prefixSum[left]. The cost of a single $O(N)$ setup is outweighed by the ability to perform every subsequent query in $O(1)$ time! #Java #100DaysOfCode #LeetCode #CodingChallenge #Algorithms #Arrays #PrefixSum #Optimization #ProblemSolving

💻 Java Practice: Character Frequency Counter using HashMap Today, I practiced a simple but powerful Java program — counting the frequency of each character in a string using the HashMap collection. This concept helped me understand how Map, containsKey(), and entrySet() work together to store and iterate over key–value pairs efficiently. 🧠 Logic Used: Take input from the user (a string). Convert it into a character array. For each character: If it’s already in the map → increment the count. Else → add it with count = 1. Finally, print each character with its frequency using entrySet(). 💡 Example: Input → banana Output → b = 1 a = 3 n = 2 This small program strengthens understanding of the Collections Framework, especially Map and Entry interfaces. 🧩 Key Learnings: Efficient data counting using HashMap Iterating entries with entrySet() Practical use of conditional checks (containsKey) Small programs build strong logic. Keep coding every day! 🚀 #Java #Coding #DSA #Collections #HashMap #JavaDeveloper #Programming #LearnByDoing #CodeEveryday #TechLearning