LeetCode Problem 500: Keyboard Row Challenge in Java

Day 94 of #100DaysOfCode 💻 📌 LeetCode Problem 500 – Keyboard Row Today’s problem was a fun string-based challenge that tested character mapping and validation logic. 🔹 The task is to find words that can be typed using letters from only one row of the keyboard. 🔹 Key learnings: Efficient string traversal Comparing characters against predefined sets Writing clean conditional logic in Java 🔹 Approach: Define all three keyboard rows Convert words to lowercase Check if every character belongs to the same row 📚 Language: Java 🧠 Concepts: Strings, Arrays, Conditional Logic 94 days in, discipline still strong — onward to Day 95! 💪🔥 #Day94 #LeetCode #Java #DSA #100DaysChallenge #CodingPractice #KeepGoing

Day 94 of #100DaysOfCode 💻 📌 LeetCode Problem 500 – Keyboard Row Today’s problem was a fun string-based challenge that tested character mapping and validation logic. 🔹 The task is to find words that can be typed using letters from only one row of the keyboard. 🔹 Key learnings: Efficient string traversal Comparing characters against predefined sets Writing clean conditional logic in Java 🔹 Approach: Define all three keyboard rows Convert words to lowercase Check if every character belongs to the same row 📚 Language: Java  🧠 Concepts: Strings, Arrays, Conditional Logic 94 days in, discipline still strong — onward to Day 95! 💪🔥  #Day94 #LeetCode #Java #DSA #100DaysChallenge #CodingPractice #KeepGoing

Day 93 of #100DaysOfCode 💻 📌 LeetCode Problem 661 – Image Smoother Today’s challenge was about matrix traversal and boundary handling. 🔹 The task is to smooth an image by replacing each cell with the average of itself and its surrounding neighbors (up to 8), considering only valid indices. 🔹 Key takeaways: Careful handling of edge and corner cases Efficient use of nested loops Understanding 2D array manipulation in Java 🔹 Approach used: Iterate through each cell Check all valid neighboring cells within a 3×3 grid Compute the average using floor division 📚 Language: Java  🧠 Concepts: Arrays, Matrix traversal, Boundary conditions Consistency over intensity — 93 days done, 7 more to go! 🔥  #Day93 #LeetCode #Java #DSA #CodingChallenge #100DaysChallenge #KeepLearning

📌 LeetCode Problem #7 – Reverse Integer 💻 Language: Java Solved the Reverse Integer problem by reversing digits using arithmetic operations while safely handling 32-bit integer overflow conditions. 🔹 Approach: • Extracted digits using modulus (%) • Rebuilt the number using multiplication and addition • Checked overflow before updating the reversed value 🧠 Concepts Used: Math Operations | Loops | Conditional Checks ⏱ Time Complexity: O(log n) 📦 Space Complexity: O(1) Practicing such problems helps strengthen my core Java logic and problem-solving skills as part of my Java Full Stack journey 🚀 #Java #LeetCode #DSA #CoreJava #ProblemSolving #JavaFullStack #CodingPractice #10000Coders

Day 93 of #100DaysOfCode 💻 📌 LeetCode Problem 661 – Image Smoother Today’s challenge was about matrix traversal and boundary handling. 🔹 The task is to smooth an image by replacing each cell with the average of itself and its surrounding neighbors (up to 8), considering only valid indices. 🔹 Key takeaways: Careful handling of edge and corner cases Efficient use of nested loops Understanding 2D array manipulation in Java 🔹 Approach used: Iterate through each cell Check all valid neighboring cells within a 3×3 grid Compute the average using floor division 📚 Language: Java 🧠 Concepts: Arrays, Matrix traversal, Boundary conditions Consistency over intensity — 93 days done, 7 more to go! 🔥 #Day93 #LeetCode #Java #DSA #CodingChallenge #100DaysChallenge #KeepLearning

🚀 Day 85 of LeetCode Challenge ✅ Problem: Merge Two Sorted Lists 🔗 https://lnkd.in/g5VY8a3n 💡 Approach: Use a dummy node to simplify list construction Maintain a current pointer to build the merged list Compare nodes from both lists and attach the smaller one Move the pointer forward until one list is exhausted Attach the remaining nodes from the non-empty list ⚡ Performance: ✅ All test cases passed (208 / 208) ⏱ Runtime: 0 ms (Beats 100.00%) 💾 Memory: 44.60 MB 📚 Key Learning: Using a dummy node avoids edge-case handling and leads to cleaner, more readable linked list solutions—especially for merge operations. 🔧 Language: Java 📈 Day 85 complete — consistency is turning effort into skill. #LeetCode #DSA #Java #LinkedList #ProblemSolving #100DaysOfCode #Consistency

day 92/100 #leetcodegrinding The number of rotations equals the index of the minimum element in the array. Using binary search, we can find this efficiently in O(log n) time. 🧠 What I focused on: Identifying the pivot (minimum element) Handling rotated vs non-rotated cases Applying binary search with correct boundaries Writing a clean and efficient Java solution This problem really strengthens understanding of rotated arrays and search logic. Keeping the streak alive 🚀 #DSA #ProblemSolving #Java #BinarySearch #Arrays #LeetCode #CodingPractice #DailyLearning

Day 97 of #100DaysOfCode 💻 📌 LeetCode Problem 482 – License Key Formatting Today’s problem focused on string manipulation and formatting logic. 🔹 The task:  Reformat a license key string so that: All letters are uppercase Groups are separated by - Each group has exactly k characters, except possibly the first 🔹 What I practiced: Traversing strings from the end Using StringBuilder efficiently Handling edge cases like trailing dashes and mixed characters 🔹 Approach: Remove all existing dashes Convert letters to uppercase Build new groups from the end and reverse the result 📚 Language: Java  🧠 Concepts: Strings, StringBuilder, Edge Cases, Formatting 97 days down — almost at the finish line! 💪🔥  #Day97 #LeetCode #Java #DSA #100DaysChallenge #StringManipulation #CodingJourney #Consistency

🚀 Day 62 of Daily LeetCode Practice Today’s focus: LeetCode Daily Question – “Maximum Number of Events That Can Be Attended II” 🧩 Solved it using an optimized approach in Java, combining: 📊 Sorting 🔍 Binary Search 🧠 Prefix Maximum DP ✨ Key Idea: Sort events by start time, maintain another array sorted by end time, and use a prefix max array to efficiently choose at most two non-overlapping events with maximum total value. ⚡ Performance Highlights: 🏎 Runtime: 37 ms (Beats 98%) 💾 Memory: 176.97 MB ✅ All test cases passed 💻 Language: Java This problem was a great reminder that clean preprocessing + smart searching can drastically improve performance. Consistency continues. Onward to Day 63 🚀 #Day60 #LeetCode #Java #DSA #ProblemSolving #DynamicProgramming #BinarySearch #CodingJourney #Consistency #SoftwareEngineering

🚀 Day 52 of #100DaysOfCode Solved LeetCode Problem #712 – Minimum ASCII Delete Sum for Two Strings. This problem focused on minimizing the total ASCII value of deleted characters to make two strings equal. A classic dynamic programming challenge that required carefully defining states and transitions for optimal substructure. Key Learnings: -> Modeled the problem using DP on string indices -> Handled base cases when one string is fully consumed -> Used memoization to avoid overlapping subproblems Strengthened understanding of string DP and cost-based optimization Language Used: Java -> Runtime: 34 ms (Beats 7.60%) -> Memory: 50.39 MB Consistent practice, deeper DP intuition, and steady progress 🚀 #LeetCode #DynamicProgramming #Java #ProblemSolving #100DaysOfCode