Move Method Refactoring Improves Encapsulation

Day 109 🚀 | Restore String (LeetCode) Rebuild the string using index mapping 🔁 👉 Place each character at its correct position ⏱ O(n) | 📦 O(n) Consistency > everything 💪 #Day109 #LeetCode #DSA #Java #GeekStreak #CodingJourney

Day 35/100 – LeetCode Challenge 🚀 Problem: 3Sum Approach: Sorted the array Fixed one element and used two pointers for the remaining two Skipped duplicates to ensure unique triplets Used early stopping when the current number became positive Time Complexity: O(n²) Space Complexity: O(1) Key takeaway: Many 3-element sum problems reduce to sorting + two-pointer pattern. #LeetCode #100DaysOfCode #DSA #Java #TwoPointers #ProblemSolving #InterviewPrep

Day 36/100 – LeetCode Challenge 🚀 Problem: 3Sum Closest Approach: Sorted the array Fixed one element and applied the two-pointer technique Tracked the closest sum by comparing absolute differences Returned immediately if an exact match was found Time Complexity: O(n²) Space Complexity: O(1) Key takeaway: Many optimization problems are variations of classic patterns. Understanding 3Sum deeply makes solving 3Sum Closest straightforward. #LeetCode #100DaysOfCode #DSA #Java #TwoPointers #ProblemSolving #InterviewPrep

💡 𝗦𝗲𝗽𝗮𝗿𝗮𝘁𝗶𝗼𝗻 𝗼𝗳 𝗖𝗼𝗻𝗰𝗲𝗿𝗻𝘀 𝗶𝗻 𝗥𝗲𝗮𝗹 𝗦𝘆𝘀𝘁𝗲𝗺𝘀 Many systems technically separate layers but still couple behavior, creating hidden architectural problems. #CleanArchitectureSeries #SpringBoot #SoftwareArchitecture #Java #CodeAIForge

I understood how ResponseEntity helps control responses like 200 OK, 201 Created, and 204 No Content. Also explored how @DeleteMapping and @PathVariable work internally in handling requests. Slowly building strong backend fundamentals 🚀 #Java #SpringBoot #RESTAPI

Day 30/100 – LeetCode Challenge 🚀 Problem: Count Binary Substrings Approach: Counted consecutive groups of 0’s and 1’s For every adjacent pair of groups, added min(prevGroup, currGroup) to the result Avoided generating substrings explicitly Time Complexity: O(n) Space Complexity: O(1) Key takeaway: Many substring problems don’t require generating substrings — they can be solved by analyzing group patterns and transitions. #LeetCode #100DaysOfCode #DSA #Java #Strings #ProblemSolving

Day 4 — Fundamentals Today → Relational & Logical Operators Conditional Statements (if–else, switch) Small problem-solving challenges. Big lesson: Writing conditions is easy. Writing clean logic is hard. Day 5 tomorrow. #LearnInPublic #Java #BuildInPublic #CodingJourney #BackendDevelopment

While working with legacy code, we often see long if-else chains used to decide behavior. They work, but as the system grows, they become hard to read, hard to maintain, and risky to change. Instead of this, we can use a HashMap to make the code cleaner and more functional. Replace multiple conditions with a map lookup: Put the behavior in a Map Fetch it using a key Use a default when nothing matches This small refactor: Improves readability Makes adding new cases easy Reduces code changes Keeps logic open for extension What approaches do you usually use when refactoring long if-else logic? #Java #SoftwareDevelopment

𝗧𝗲𝘀𝘁𝗶𝗻𝗴 𝗣𝗮𝘁𝘁𝗲𝗿𝗻𝘀 Integration tests tend to grow where architectural seams are missing. That growth is often a useful signal, not a failure. #CleanArchitectureSeries #SpringBoot #SoftwareArchitecture #Java

🚀 Day 20 – #100DaysOfLeetCode Today’s problem: Product of Array Except Self (Medium) 🔹 Learned how to solve it in O(n) time 🔹 Without using division 🔹 Optimized space complexity The key idea was using prefix and suffix products instead of recalculating product every time. #Day20 #LeetCode #DSA #Java #CodingJourney