Isomorphic Strings Problem Solving with LeetCode 205

#Day92 Of Problem Solving Today’s LeetCode problem turned out to be simpler than I expected — but only after looking at it from the right angle. At first, I was thinking of solving it using loops or recursion. But then I realized there’s a much cleaner way using a small mathematical trick to check if a number is a power of three. That shift in thinking made the solution not just easier, but also more efficient. Result: Runtime: 7 ms (beats 100%) Memory: 46 MB Moments like this remind me that problem solving isn’t always about writing more code, it’s about finding better approaches.Trying to stay consistent and improve a little every day. #LeetCode #Java #DSA #ProblemSolving #CodingJourney #LinkedIn

“What I learned after solving 300+ LeetCode problems 👇” At the beginning, I made a mistake. I kept solving random problems every day thinking: “More problems = more skill” But I was wrong. I realized that solving problems randomly is mostly a waste of time if you don’t understand the pattern behind them. Everything changed when I started focusing on patterns instead of problems. Here are some important patterns I learned: • Sliding Window • Two Pointers • Prefix Sum • Binary Search • Recursion & Backtracking • Linked List Patterns • Stack & Monotonic Stack • Hashing / Frequency Count Once you understand these patterns: You don’t need to solve 1000 problems. You start recognizing solutions instantly. Now when I see a problem, I don’t panic. I ask: 👉 “Which pattern does this belong to?” That one question changed everything for me. Still learning, but now with direction 🚀 #DSA #LeetCode #Java #BackendDevelopment #CodingJourney

There was a time when even starting a problem felt confusing. Reading the question multiple times, not knowing where to begin, and getting stuck often. With consistent practice, things started to change — patterns became familiar, approaches became clearer, and solving started to feel more structured. That consistency has now led to solving 150 problems on LeetCode. Focused on building a strong foundation through arrays, strings, hashing, sliding window, and binary search — spending more time understanding the logic rather than just aiming for accepted submissions. This journey improved: * Problem breakdown and thinking approach * Pattern recognition across questions * Code clarity and structure Currently working on improving speed and taking on more challenging problems. 🔗 LeetCode Profile: https://lnkd.in/gkf7m6wp #LeetCode #DSA #Java #ProblemSolving #Coding #SoftwareEngineering

I'll be discussing Test Driven Development tonight 7pm with Shammy Narayanan. Why TDD? And is TDD even relevant today in the age of AI and Agentic coding? Join the discussion to get the answers 😃 Details in the post below 👇🏽

🔥 Day 31/100 – DSA Problem Solving 📌 Problem: 412. Fizz Buzz (LeetCode) Today’s problem looks simple, but it really tests your logic building and attention to detail. 💡 My Approach: I used a loop from 1 to n For each number: If divisible by both 3 & 5 → "FizzBuzz" If divisible by 3 → "Fizz" If divisible by 5 → "Buzz" Otherwise → convert number to string 🧠 What I Learned Today: ✅ Importance of using the correct variable inside loops ✅ Order of conditions matters (3 & 5 first) ✅ Writing clean and readable logic ✅ Even easy problems can teach debugging skills 🚀 Key Takeaway: Don’t underestimate easy problems — they help build strong fundamentals and improve problem-solving thinking. 💻 Code Concept: Used simple loop + conditional statements + list to store results. #Day31 #100DaysOfCode #DSA #LeetCode #Java #CodingJourney #ProblemSolving

🚀 Day 8 of Java with DSA Journey 🚀 📌 Topic: FizzBuzz (LeetCode 412) 💬 "Clean code is not written by following rules, but by following logic." ✨ What I learned today: 🔹 Condition Priority Matters Checking FizzBuzz (divisible by both 3 & 5) first is crucial. Order defines correctness. 🔹 String Handling Used Integer.toString(i) for clean output formatting. 🔹 Code Readability Even simple problems test how clearly you structure your logic. 🔹 Complexity Awareness ⏱ Time Complexity: O(n) 📦 Space Complexity: O(1) (excluding output list) 🧠 Problem Solved: ✔️ FizzBuzz 🎨 Visualizing the Logic (Decision Tree) Each number flows through conditions like a filter. It stops at the first true condition, which makes ordering critical. 💡 Key Insight: FizzBuzz may look simple, but it teaches precise logical structuring and modular arithmetic (%). 👉 The “15 Test”: If we check i % 3 == 0 first, 15 becomes "Fizz" and skips "Buzz". By checking (i % 3 == 0 && i % 5 == 0) first, we correctly get "FizzBuzz". ⚡ Interview Insight (Scalability Twist): What if we add a new condition like 7 → "Bazz"? Instead of messy if-else, use string concatenation: String currentStr = ""; if (i % 3 == 0) currentStr += "Fizz"; if (i % 5 == 0) currentStr += "Buzz"; if (currentStr.isEmpty()) currentStr += i; answer.add(currentStr); ✅ Easier to extend ✅ Cleaner logic ✅ More maintainable 🔑 Takeaway: Consistency beats complexity. Showing up daily builds real problem-solving skills. #DSA #LeetCode #Java #CodingJourney #ProblemSolving #Day8 #CleanCode #SoftwareEngineering #FizzBuzz #Array #InterviewPrep #Optimization #MCA #lnct #100DaysOfCode #SoftwareEngineering #InPlaceAlgorithms #TechLearning #JavaDeveloper

Most people think coding is about writing logic. But it's something deeper… It’s about thinking clearly when things don’t work. I spent hours debugging a small issue, not because it was hard, but because my thinking was messy. The moment I slowed down, broke the problem and questioned every assumption… The solution appeared in minutes💡 Good developers don’t just code fast. They think better. And that’s what I’m working on every single day. #SoftwareDevelopment #CodingJourney #ProblemSolving #Java #Learning

🚀 200 problems on LeetCode — but the real growth isn’t just a number. Somewhere along the journey, my approach changed. I stopped asking: ❌ “How do I solve this problem?” And started asking: ✅ “Why does this approach work?” ✅ “What pattern is behind this?” ✅ “Where else can I apply this?” That shift made all the difference. 📈 What I’ve built so far: ✔ Stronger problem-solving mindset ✔ Better understanding of data structures ✔ Pattern recognition across problems ✔ More structured debugging approach Now, I don’t just solve problems — I understand them. Still learning. Still improving. But now with clarity and direction. #LeetCode #DSA #ProblemSolving #CodingJourney #Java

𝐁𝐞𝐜𝐨𝐦𝐢𝐧𝐠 𝐚 𝐃𝐞𝐯𝐞𝐥𝐨𝐩𝐞𝐫 𝐁𝐞𝐟𝐨𝐫𝐞 𝐁𝐞𝐜𝐨𝐦𝐢𝐧𝐠 𝐚𝐧 𝐄𝐦𝐩𝐥𝐨𝐲𝐞𝐞 1.6% of transforming into a developer. Yesterday I explored how classes can be connected using Inheritance. Today, I focused on understanding another important concept — Polymorphism. What I practiced today: • Runtime Polymorphism → Method Overriding (Employee → Developer / Manager) • Method Overloading → Handling multiple inputs in Python • Applying polymorphism in simple real-world scenarios I practiced using .ipynb notebooks, writing code step by step, testing outputs, and refining my understanding. I also pushed my practice code to GitHub, continuing my habit of tracking progress. What changed in my thinking today: Before → Writing separate methods for different behaviors Now → Writing one method that works differently based on the object That helped me understand: Polymorphism is about writing flexible code. The goal remains the same: Learn daily. Improve daily. Level up daily. 1.6% today. Still building. 🚀 #Python #OOPS #Polymorphism #LearningJourney #DeveloperJourney #StudentDeveloper #Programming #BuildInPublic #Consistency #SoftwareEngineering

🔥 Day 3 of my 50 Days Wild Coding Kickoff! 🔥 💡 Problem 3: Valid Parentheses (Easy) Given a string containing just '(', ')', '{', '}', '[' and ']', determine if the input string is valid. A string is valid if: ✔ Open brackets are closed by the same type ✔ Open brackets are closed in the correct order Example 1: Input: s = "[]" Output: true Example 3: Input: s = "[(])" Output: false 🚀 Approach (Optimized without Stack class): Instead of using Java’s built-in Stack, I used a char array to simulate a stack for better performance. Created a char[] as stack Used top pointer to track elements Push opening brackets On closing bracket → pop and compare If mismatch or stack empty → invalid #100DaysOfCode #50DaysOfCode #CodingChallenge #JavaDeveloper #DataStructures #Stack #Algorithms #DSA #CodingJourney #InterviewPrep #LeetCode #ProblemSolving #DeveloperLife #CodingDaily #CodePractice