Sébastien Deleuze’s Post

🚀 Day 70 Today’s problem: Type of Triangle 🔺 ✨ Even simpler approach (no extra space): Just sort + direct comparison — no HashSet needed! 💡 Steps: Sort the array Check triangle condition → a + b > c Compare values directly: All equal → Equilateral Any two equal → Isosceles All different → Scalene 🧠 Minimal Code Idea: No extra data structures Fewer lines More readable 🔥 Why better? Less memory + faster checks = clean & optimal thinking 💬 Takeaway: Good code isn’t just correct — it’s simple and efficient. #Day70 #DSA #Java #CleanCode #LeetCode #CodingJourney

Day 9 of #75DaysOfDSA Solved: 3Sum Closest (LeetCode – Medium) Today’s problem focused on optimizing from a brute-force O(n³) approach to an efficient O(n²) solution using Sorting + Two Pointers. Key Learnings: How sorting enables intelligent pointer movement Applying two-pointer technique inside a loop Tracking the closest value using absolute difference Improving time complexity through pattern recognition Result: Accepted – 107/107 test cases passed Runtime: 16 ms (Beats 93.41%) Memory: Beats 95.72% #DSA #Java #LeetCode #ProblemSolving #CodingJourney #DataStructures #Algorithms

Day 34/50 🚀 — Score of a String Today’s problem was all about observing patterns in characters and keeping the approach simple. 🔹 Compared ASCII values of adjacent characters 🔹 Used absolute difference to calculate contribution 🔹 Built the result in a single pass (no extra space) Key insight: Sometimes you don’t need complex data structures—just a clean loop and understanding how characters behave as numbers. 💡 Simple logic, implemented cleanly, is often the most efficient solution. Performance: ⚡ Runtime: 1 ms (99%+) 📦 Memory: Efficient #Day34 #50DaysOfCode #Java #DSA #ProblemSolving

API versioning used to be an implementation problem. Now it’s an architecture problem. With tools like IBM Bob, you can generate versioned APIs in Quarkus in seconds. Path versioning, headers, media types — all done automatically. But here’s the catch: if your strategy is wrong, you just created technical debt faster than ever. I broke down the 3 approaches and when they actually make sense 👇 https://lnkd.in/dUs8iMb4 #Java #Quarkus #SoftwareArchitecture #API #BackendDevelopment #AI

Day 101: Clean Code is Scalable Code 🚀 Problem 3741: Minimum Distance Between Three Equal Elements II They say if you solve a problem correctly once, the "Hard" version becomes easy. Today was proof of that. The Strategy: • Reusable Logic: My solution from yesterday handled the transition to Part II perfectly. The core logic of tracking indices in a HashMap and applying a sliding window of three was already optimal. • The "Part II" Test: Even with increased constraints or complexity in the problem description, O(N) frequency tracking and index-gap calculations proved to be the robust way to go. • Efficiency: By isolating only the elements that appeared 3+ times, I kept the runtime minimal and the memory footprint low. It's a great feeling when the architecture you built yesterday is strong enough to handle today's challenge without a single line of refactoring. Day 101 and the momentum is only increasing. ⚡ #LeetCode #Java #Algorithms #DataStructures #ProblemSolving #DailyCode

Topic: Learning from Legacy Code Legacy code is not bad code. It’s code that has survived real-world use. Many developers try to rewrite legacy systems completely. But legacy code often contains: • Proven business logic • Edge case handling • Years of real production experience Instead of rewriting everything: • Understand existing behavior • Refactor step by step • Improve where needed • Preserve what works Because rewriting without understanding can introduce new risks. Good engineers don’t just build new systems. They improve existing ones intelligently. Have you worked on legacy systems? What did you learn? #SoftwareEngineering #LegacyCode #BackendDevelopment #Java #CleanCode

Live from Spring I/O : how to make your existing APIs securely available to an #ai agent in the #Java ecosystem. #springio #java #ai

Day 39 of showing up consistently 💻✨ Today’s problem looked simple—but tested logic, structure, and attention to detail. Solved Valid Parentheses using a stack-based approach, reinforcing how LIFO structures help in real-time validation problems. 🧠 Key Learnings: • Stacks are perfect for matching patterns • Order matters just as much as correctness • Edge cases can break naive logic 📊 Performance: ⚡ Runtime: 4 ms 💾 Memory optimized ✅ 100% test cases passed Every day isn’t about speed—some days are about sharpening fundamentals. #Day39 #LeetCode #DSA #Java #ProblemSolving #Consistency #Stack #CodingJourney

Day 103 - LeetCode Journey Solved LeetCode 232: Implement Queue using Stacks ✅ Classic problem where you reverse the thinking. Queue is FIFO, but stacks are LIFO… So the trick is to use two stacks to simulate queue behavior. Approach used: Push → reverse elements using second stack Pop/Peek → operate directly from main stack Key learnings: • Understanding stack vs queue behavior • Using two stacks to reverse order • Designing data structures from scratch • Thinking in terms of operations, not just code ✅ All test cases passed ⚡ Efficient and clean implementation This is one of those problems that builds strong fundamentals 💪 #LeetCode #DSA #Stack #Queue #Java #CodingJourney #ProblemSolving #InterviewPrep

What’s new in #Java? Highlights from the latest roundup: GA releases of GraalVM Native Build Tools 1.0 and EclipseLink 5.0; the March 2026 edition of Open Liberty; 4th milestone releases of Spring Boot, Spring Modulith and Spring AI; a point release of Quarkus; the first development release of Infinispan; and a maintenance release of GlassFish. Read more 👉 https://bit.ly/4bIpcX4 #InfoQ #JavaUpdates #JavaNews