Boyer-Moore Voting Algorithm for LeetCode 169 in Java

Solved LeetCode 17 – Letter Combinations of a Phone Number using backtracking in Java. Approach: Mapped each digit (2–9) to its corresponding characters using a simple array for O(1) access. Then used backtracking to build combinations digit by digit. For every digit: Pick each possible character Append → explore next digit → backtrack Key idea: Treat it like a tree of choices, where each level represents a digit and branches represent possible letters. Key learnings: Backtracking = build → explore → undo StringBuilder helps avoid unnecessary string creation Problems like this are about systematic exploration of choices Time Complexity: O(4^n * n) Space Complexity: O(n) recursion stack + output Consistent DSA practice is strengthening pattern recognition day by day. #Java #DSA #Backtracking #LeetCode #CodingInterview #SoftwareEngineering

Day 6 - Externalization Vs Serialization in Java !! As we know, the Serializable interface in Java allows us to perform serialization, effectively turning an object into a byte stream for storage or transmission. What is externalization ? 💫 Externalization is a customized serialization mechanism. Unlike the Serializable marker interface, it allows developers to explicitly define the logic for saving and restoring an object's data through marshalling and unmarshalling. #java #backend #coding #developer #learning #springboot

Day 88 - LeetCode Journey Solved LeetCode 24: Swap Nodes in Pairs in Java ✅ This problem is a great exercise in pointer manipulation in linked lists. Instead of changing values, I swapped the actual nodes by carefully adjusting the next pointers. Using a dummy node made the process much cleaner and helped handle edge cases smoothly. Step by step, I swapped pairs while moving forward in the list. Key takeaways: • Deep understanding of pointer manipulation • Importance of dummy node in linked list problems • Clean handling of edge cases • Iterative approach for swapping nodes ✅ All test cases passed ⚡ Efficient O(n) time and O(1) space Linked list problems like this really sharpen your fundamentals 🔥 #LeetCode #DSA #Java #LinkedList #Pointers #ProblemSolving #CodingJourney #InterviewPrep #Consistency #100DaysOfCode

#Day88 of #100DaysOfCode Continued working on string manipulation in Java with a focus on problem-solving. Practiced: - Checking anagrams - Finding first non-repeating character - Implementing toggle case logic Focused on improving string handling and writing efficient solutions using loops and conditions. #Java #Strings #100DaysOfCode

Multithreading in Java finally clicked for me when I stopped memorizing it… and started visualizing it. 🧠 Here’s the simplest way to understand it: Imagine your application is doing only ONE task at a time. ➡️ Slow ➡️ Blocking ➡️ Poor performance Now introduce multithreading 👇 Multiple tasks run simultaneously: ✔ One thread handles API requests ✔ One processes data ✔ One writes logs Result? Faster and more efficient applications 🚀 But here’s what I learned the hard way: Multithreading is powerful… but dangerous if not handled properly. Common issues I faced: Race conditions Deadlocks Unexpected bugs What helped me: ✔ Proper synchronization ✔ Understanding thread lifecycle ✔ Using ExecutorService instead of manual threads Lesson: Multithreading is not just about speed — it’s about control and correctness. 💬 Have you faced any tricky bugs with multithreading? #Java #Multithreading #BackendDevelopment #SoftwareEngineering #Coding

Day 94 - LeetCode Journey Solved LeetCode 35: Search Insert Position in Java ✅ Classic Binary Search problem that tests your fundamentals. Instead of just finding the element, the twist is to return the correct insert position if it’s not present. The key idea is simple: keep narrowing the search space and finally return low, which represents the right position. Clean logic, high impact 💡 Key takeaways: • Strong grip on Binary Search fundamentals • Understanding search space boundaries • Returning correct insertion index • Writing efficient O(log n) solutions ✅ All test cases passed ⚡ O(log n) time and O(1) space Mastering basics like Binary Search is what builds real problem-solving strength 🔥 #LeetCode #DSA #Java #BinarySearch #ProblemSolving #CodingJourney #InterviewPrep #Consistency #100DaysOfCode

Day 46 – Understanding Method Overloading in Java ☕ Today I focused on revising the concept of Method Overloading in Java and understanding how it works internally. Topics covered: 🔹 What is method overloading 🔹 How the compiler selects the appropriate method 🔹 Steps involved in method resolution 🔹 Why it is called compile-time polymorphism 🔹 Why it is referred to as early binding Understanding how the compiler decides which method to invoke based on parameters helped me gain deeper clarity on Java’s execution process. Strengthening my core OOP concepts step by step 🚀 #Day46 #JavaJourney #OOP #MethodOverloading #CoreJava #Consistency

Day 62 of #100DaysOfLeetCode 💻✅ Solved #219. Contains Duplicate II problem in Java. Approach: • Used two nested loops to compare elements within range k • For each element, checked next k elements • If any duplicate is found within distance k, returned true • If no such pair exists, returned false Key Learning: ✓ Practiced checking duplicates within a given range ✓ Strengthened understanding of array traversal with conditions ✓ Learned the importance of optimizing nested loop solutions Learning one problem every single day 🚀 #Java #LeetCode #DSA #Arrays #ProblemSolving #CodingJourney #100DaysOfCode

🚀 Day 7/30 — LeetCode Challenge Solved "Roman to Integer" on LeetCode using Java. The key challenge was handling "subtractive notation"— cases like IV (4) and IX (9), where a smaller value appears before a larger one. Used a HashMap for value mapping and adjusted the result based on the relationship between adjacent characters. ✅ Key takeaway: Understanding patterns in rules is more important than just implementing logic. #LeetCode #Java #Algorithms #ProblemSolving #Consistency