Mastering Java on LeetCode with Prefix Suffix Product

🚀 Mastering Java Through LeetCode 🧠 Day 8 Continuing my journey of solving problems from the LeetCode 75 list to improve my Data Structures and Algorithms (DSA) skills using Java. Consistency is helping me strengthen my problem-solving ability and logical thinking for real-world software development. 📌 LeetCode Problem Solved Today: Q. 334 – Increasing Triplet Subsequence 🔹 Problem Statement: Given an integer array nums, return true if there exists a triple of indices (i, j, k) such that: i < j < k nums[i] < nums[j] < nums[k] If no such triplet exists, return false. 🔹 Approach I Used: Instead of checking all possible triplets (which would be inefficient), I used an optimized approach: Track the smallest number seen so far. Track the second smallest number greater than the first. If we find a number greater than both, an increasing triplet exists. This makes the solution efficient. Time Complexity: O(n) Space Complexity: O(1) 📊 Example: Input: [2,1,5,0,4,6] Output: true Valid Triplet: 0 < 4 < 6 Every day I’m learning something new and improving my coding skills step by step. 🚀 #LeetCode #Java #DSA #CodingJourney #ProblemSolving #SoftwareDevelopment #LearningInPublic #OpenToWork #Coding #SoftwareEngineer #LeetCode75

Day 83 - LeetCode Journey Solved LeetCode 237: Delete Node in a Linked List in Java ✅ This problem was a bit different from usual linked list questions. Instead of deleting a node in the traditional way, we weren’t given access to the head of the list. That’s what made it interesting. The trick was to think differently. Instead of removing the node directly, copy the value of the next node into the current node and skip the next node. Simple idea, but not obvious at first. This problem really tests your understanding of how linked lists work internally. Key takeaways: • Thinking beyond standard approaches • Understanding pointer manipulation deeply • Writing minimal and efficient code • Strengthening core linked list concepts ✅ All test cases passed ✅ Clean and optimal solution Problems like these remind me that DSA is not just about coding, but about thinking differently 💡 #LeetCode #DSA #Java #LinkedList #ProblemSolving #Algorithms #CodingJourney #InterviewPreparation #Consistency

🚀 Day 75 — LeetCode Practice 🚀 Today’s problem: To Lower Case 💡 What I learned today: • Understood how to convert characters using built-in string methods • Learned the importance of string immutability in Java • Practiced writing clean and minimal code • Realized that sometimes the simplest problems reinforce core concepts 🧠 Key Idea: Use Java’s inbuilt function: toLowerCase() → converts all uppercase letters to lowercase easily 🔥 Takeaway: Not every problem needs complex logic — knowing the right method saves time ⏱️ Consistency > Complexity 💯 #Day75 #LeetCode #Java #DSA #CodingJourney #Consistency #Learning

🚀 Day 55 of #100DaysOfCode — Getting Started with Multithreading in Java Over the past 2 days, I explored one of the most important concepts in Java: Multithreading 🔥 💡 What I Learned 🧵 What is Multithreading? Multithreading allows a program to execute multiple tasks simultaneously, improving performance and efficiency ⚡ 👉 Instead of running tasks one after another, we can run them in parallel. ⚙️ Creating Threads in Java 1️⃣ Using Thread Class Extend the Thread class Override the run() method Start using start() 2️⃣ Using Runnable Interface (Best Practice ✅) Implement Runnable Pass it to a Thread object Start execution using start() 🧠 Key Takeaways ✔ Runnable is preferred over Thread (better design & flexibility) ✔ Supports multiple inheritance ✔ Separates task from execution ✔ Helps in building scalable backend systems ⚠️ Important Concept 👉 Difference between: run() ❌ (normal method call) start() ✅ (creates new thread) 🔥 Real-World Use Cases Backend APIs Payment systems Real-time applications Inventory & billing systems (like the one I'm building 🏪) 🚀 What’s Next? ➡️ Synchronization ➡️ Race Conditions ➡️ ExecutorService (Thread Pool) Learning multithreading feels like unlocking a new level in Java 💪  Huge thanks to my mentor Suresh Bishnoi for simplifying complex concepts like multithreading and pushing me to keep learning consistently. #Java #Multithreading #100DaysOfCode #BackendDevelopment #LearningJourney

Day 93/100 | Building Consistency 🦅 Showing up every day. Learning, growing, and improving. I stopped coding first… and started thinking in constraints. Most people do this: Write Java code → then check Time Complexity But today I flipped it: Analyze constraints → choose approach → then code in Java What I focused on: Before touching the keyboard, I asked: • Can this problem afford O(n²)? • Do I need O(n log n)? • Is O(n) the only scalable solution? then i realized: In Java, writing code is easy… but writing efficient code with the right approach is what actually matters. Because: • Nested loops = danger if constraints are high • Collections (HashMap, ArrayList) = powerful when used right • Choosing the wrong approach = TLE, no matter how clean your code is Pattern I’m building: Constraints → Approach → Data Structure → Clean Java Implementation Day 93 — not just coding in Java, but thinking like a problem solver before coding. 🚀 #Day93 #100DaysOfCode #DSA #Java #JavaDeveloper #CodingJourney #ProblemSolving #TimeComplexity #SoftwareEngineering #Tech #Developers #Programming #LearnToCode #CodeNewbie #CareerGrowth #TechCareers #CodingLife #DeveloperMindset

What happens when you're tasked with debugging a legacy codebase that's been untouched for years? I still remember my first encounter with such a project, it was like trying to decipher a puzzle written in a language I barely understood. My team and I were assigned to refactor a massive Java application that had been built over a decade ago. The code was a mess of nested if-else statements, obscure variable names, and outdated libraries. It was overwhelming, to say the least. One particular issue that had me stumped was a tricky null pointer exception that would occur only under certain conditions. I spent hours poring over the code, trying to identify the culprit, until I stumbled upon a hidden gem of a method that was the root cause of the problem. The fix was relatively simple, just a few lines of code: ```java if (object == null) { return Optional.empty(); } else { return Optional.of(object); } ``` This experience taught me the importance of patience, persistence, and attention to detail when working with legacy code. What's the most challenging debugging experience you've had, and how did you overcome it? #DebuggingWarStories #LegacyCode #Java #Refactoring #CodeQuality #SoftwareDevelopment #ProgrammingChallenges #TechJourney

💡 **Why Java Collection Framework is a Game Changer in Problem Solving** While going through my **Tata ILP training**, I’ve been spending time understanding the **Java Collection Framework**, and honestly, it completely changes the way you approach problems. Instead of thinking in terms of complex logic first, collections help you **organize data efficiently** — and that itself solves half the problem. 🔹 Need fast lookups? → Use a HashMap 🔹 Need unique elements? → HashSet does it instantly 🔹 Need ordering or sorting? → Lists and Trees make it simple What I realized is that most coding problems are not about writing long code, but about **choosing the right data structure**. Once that’s clear, the solution becomes much easier. To practice this, I worked on a small implementation and uploaded it on GitHub 📂 🔗 https://lnkd.in/gaRSsveu I’ve also added **proper comments in the code** so that anyone going through it can clearly understand the thought process and logic. Still learning, still improving — one concept at a time 🚀 #Java #JavaCollections #ProblemSolving #TataILP #CodingJourney #GitHub #LearnToCode #GrowthMindset

Day 14 of my coding journey — Extracting Unique Words using Java Streams Today I explored a clean and efficient way to extract unique words from a string using Java Streams. Instead of writing multiple loops and conditional checks, I leveraged the power of functional programming: Grouped words using a frequency map Filtered out words that appear more than once Collected only truly unique words in a concise pipeline What I really liked about this approach is how readable and expressive the code becomes. It clearly shows what we want to achieve rather than how step-by-step. Key takeaway: Writing optimized code is not just about performance — it’s also about clarity, maintainability, and using the right abstractions. Every day I’m getting more comfortable thinking in terms of streams, transformations, and data flow. If you have alternative approaches or optimizations, I’d love to hear them. #Day14 #Java #CodingJourney #JavaStreams #BackendDevelopment #ProblemSolving #CleanCode

🚀 Java Full Stack Journey – Day 7 Today’s session was all about applying Java concepts to solve real-time problems using formulas and calculations. 🔹 What I learned: Implementing Java programs using user-defined values Writing logic for mathematical calculations Understanding how formulas are translated into code 🔹 Programs Covered: ✔️ Area of Circle ✔️ Area of Triangle ✔️ Square & Cube of a Number ✔️ Total & Percentage Calculation ✔️ Real-time scenarios like: 🛒 Purchase calculations with discounts 🍎 Product price calculations (e.g., apples) 🏨 Hotel billing system 🔹 Key Takeaways: Improved my problem-solving skills Learned how to convert real-world scenarios into Java programs Gained clarity on using formulas in coding 💡 Coding is not just syntax, it's about solving real-life problems efficiently. 📌 Step by step, getting closer to becoming a Java Full Stack Developer 💻🔥 #Java #FullStackDeveloper #LearningJourney #Programming #Coding #JavaBasics #ProblemSolving #Consistency

🚀 Mastering Java Through LeetCode 🧠 Day 22 of My DSA Journey Today I solved an interesting matrix-based problem that improved my understanding of arrays and comparison logic. 📌 LeetCode Problem Solved Today: 2352 – Equal Row and Column Pairs Problem Statement: Given an n x n matrix, find how many pairs (row, column) are exactly the same. A pair is valid only if both contain the same elements in the same order. 🧠 Key Idea: Compare each row with every column Check element-by-element equality Count all matching pairs 🔍 Example: Input: [[3,2,1], [1,7,6], [2,7,7]] Output: 1 Matching Pair: Row 2 = Column 1 → [2,7,7] ⚙️ Approach: Traverse all rows Build each column dynamically Compare row[i][k] with column[k][j] If all elements match → increment count ⏱️ Time Complexity: O(n³) (Optimized solution using HashMap possible in O(n²)) What I Learned: Matrix traversal techniques Row vs Column comparison logic Importance of nested loops in grid problems 🔥 Consistency is the key! Every day one problem closer to my goal of becoming a Software Engineer #LeetCode #DSA #Java #CodingJourney #100DaysOfCode #SoftwareEngineer #ProblemSolving #Learning #Tech