Merging Intervals in Java with Efficient Sorting and Traversal

Day 95/200 – LeetCode Challenge. Problem: Remove Duplicates from Sorted List II (Java) Today’s focus was eliminating all duplicate values from a sorted linked list while keeping only distinct nodes. Implemented an efficient two-pointer approach with a dummy node to handle edge cases cleanly. Linked lists require careful pointer management. Dummy nodes simplify boundary conditions. One-pass solution ensures optimal performance. Continuing the 200-day journey, one problem at a time. #LeetCode #Java #CodingChallenge #200DaysOfCode #ProblemSolving

🚀 Day 21 of #128DaysOfCode 🔍 Key Learnings: Efficient searching in O(log n) Using low & high to narrow the range Finding correct position even if target is absent 🧠 Approach: Compare mid with target → move left/right → return index or insert position Consistency is key 🔥 #DSA #Java #CodingJourney #PlacementPreparation

Day 37 — Merge Intervals ✅ Solved the classic Merge Intervals problem on LeetCode. Key idea: - Sort intervals by start time - Traverse and merge overlapping intervals - Keep updating the end boundary Time Complexity: O(n log n) Space Complexity: O(n) This problem looks simple, but tests your ability to think clearly about overlapping ranges — something that shows up a lot in real-world scenarios. Consistency > motivation. Showing up daily. #leetcode #dsa #problemSolving #codingJourney #java #100DaysOfCode

DSA – Day 40 Continuing the journey with consistent practice and strengthening advanced linked list concepts 🚀 📘 Today’s Topic: Linked Lists (Java) 🧠 Problem Solved: 445. Add Two Numbers II ➕ 🎯 Practiced adding numbers represented by linked lists where digits are stored in forward order. This problem helped reinforce concepts like stack usage / reversing lists and handling carry efficiently. Building deeper understanding of linked list variations through consistent effort 💪 One day at a time. Staying consistent 🚀 #DSA #Java #LinkedList #LeetCode #Placements #Consistency 🚀

Day 60 - Remove Duplicates from Sorted List Worked on removing duplicate elements from a sorted linked list. Approach: • Traverse the list once • Compare current node with next node • Skip duplicate nodes by adjusting pointers Time Complexity: O(n) Space Complexity: O(1) #Day60 #LeetCode #Java #LinkedList #CodingPractice #DSA #TechJourney

Day: 95/365 📌 LeetCode POTD: Minimum Distance Between Three Equal Elements II Medium Key takeaways/Learnings from this problem: 1. This one highlights how tracking indices smartly is more important than checking all triplets brute-force. 2. Using previous occurrences helps you narrow down valid triples quickly instead of re-scanning the array. 3. Big takeaway: problems with “equal elements” often reduce to index management + pattern observation. 4. Also a good reminder that optimizing from O(n³) thinking to near O(n) comes down to storing the right info while iterating. #POTD #365DaysOfCode #DSA #Java #ProblemSolving #LearningInPublic #Consistency 🥷

🚀 #DrGVishwanathanChallenge Day 3 Solved another interesting problem today: Check if Array is Sorted & Rotated (Java) 💻 💡 Key Takeaways: Understanding array patterns (sorted + rotation) Handling edge cases efficiently Improving logical thinking with conditions Consistency is the key 🔥 📌 #DrGVishwanathanChallenge #VITBhopal #DSA #Java #CodingJourney #Consistency

Day: 75/365 📌 LeetCode POTD: Determine Whether Matrix Can Be Obtained By Rotation Easy Key takeaways/Learnings from this problem: 1. This problem shows that sometimes brute force (trying all 4 rotations) is perfectly fine and clean. 2. Rotating a matrix becomes easy once you remember the transpose + reverse trick. 3. Always compare after each rotation instead of overcomplicating the logic upfront. #POTD #365DaysOfCode #DSA #Java #ProblemSolving #LearningInPublic #Consistency 🥷

Day 69 – Add Two Numbers (Linked List) Solved a problem to add two numbers represented as linked lists where each node stores a single digit in reverse order. Key Learnings: Simulated digit-by-digit addition with carry handling similar to manual arithmetic Used a dummy node to simplify result list construction Handled different list lengths and leftover carry efficiently #DSA #Java #LinkedList #ProblemSolving #CodingPractice #DataStructu

Day: 78/365 📌 LeetCode POTD: Equal Sum Grid Partition I Medium Key takeaways/Learnings from this problem: 1. This problem highlights how prefix sums make grid partitioning super efficient instead of recalculating sums again and again. 2. The key is trying splits smartly (row-wise or column-wise) and checking if both parts can balance out. 3. It’s a good reminder that many 2D problems become easier when you reduce them to 1D cumulative sums. #POTD #365DaysOfCode #DSA #Java #ProblemSolving #LearningInPublic #Consistency 🥷