Solving Reverse Integer Problem on LeetCode with Java

🚀 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

🚀 Day 6/30 — LeetCode Challenge Solved "Divide Two Integers" on LeetCode using Java. This problem restricts the use of division, multiplication, and modulus — forcing an alternative approach using "bit manipulation and subtraction logic". Handled tricky edge cases like overflow (Integer.MIN_VALUE / -1) to ensure correctness. ✅ Key takeaway: Constraints push you to think beyond standard solutions and understand how operations work at a deeper level. #LeetCode #Java #Algorithms #ProblemSolving #Consistency

🚀 Day 3/30 — LeetCode Challenge Solved Median of Two Sorted Arrays on using Java. This wasn’t about merging arrays — the real challenge was applying binary search on partitions to achieve optimal time complexity. ✅ Key takeaway: Efficiency comes from thinking differently, not doing more work. Using partition-based binary search reduces complexity to O(log(min(n, m))). This problem pushed me to understand the logic deeply rather than just implementing it. #LeetCode #Java #Algorithms #BinarySearch #ProblemSolving #Consistency Archana J E Divya Suresh Harini B harilakshmi s Bavani k Bhavya B Devipriya R

🚀 Day 4/30 — LeetCode Challenge Solved the "Palindrome Number" problem on LeetCode using Java. The logic is simple, but the key is choosing the right approach — reversing only half of the number instead of the entire value to avoid unnecessary operations. ✅ Key takeaway: Even simple problems have smarter solutions if you focus on efficiency. Continuing to build consistency and improve problem-solving skills. #LeetCode #Java #Algorithms #ProblemSolving #Consistency

🚀 Day 48/100:-Odd String Difference Not every problem is about writing code — some are about seeing patterns clearly. 🧠 Today, I worked on the "Odd String Difference" problem using Java. 🔍 Instead of comparing strings directly, I learned to: • Convert each string into a difference array • Identify patterns between characters • Detect the one string that breaks the pattern 💡 Key takeaway: Breaking a problem into smaller transformations makes complex logic much easier to handle. ⚡ Result: Efficient solution with strong runtime and memory performance ✅ Step by step, improving not just coding — but the way I think. #Day48 #100DaysOfCode #DSA #Java #ProblemSolving #LeetCode #Consistency #LearningInPublic

🚀 Day 8/30 — LeetCode Challenge Solved "Swap Nodes in Pairs" on LeetCode using Java. This problem focuses on "rearranging node connections", not just swapping values — making pointer handling critical. Used a dummy node approach to simplify edge cases and ensure smooth pair-wise swapping. ✅ Key takeaway: Linked list problems are less about logic and more about **precise pointer management** — one wrong link can break the entire structure. #LeetCode #Java #LinkedList #DataStructures #ProblemSolving #Consistency

#repost Day1 - 𝐒𝐦𝐚𝐥𝐥 𝐂𝐨𝐧𝐜𝐞𝐩𝐭, 𝐁𝐢𝐠 𝐈𝐦𝐩𝐚𝐜𝐭 – 𝐉𝐚𝐯𝐚 𝐈𝐧𝐝𝐞𝐱𝐢𝐧𝐠 💡 In Java, array index starts from 0 because it represents the distance (offset) from the starting point in memory. 👉 Index 0 → First element (0 steps from start) 👉 Index 1 → Second element (1 step away) This makes calculations simple and fast: 𝑨𝒅𝒅𝒓𝒆𝒔𝒔 = 𝑩𝒂𝒔𝒆 + (𝑰𝒏𝒅𝒆𝒙 × 𝑺𝒊𝒛𝒆) 💡 Starting from 0 𝐚𝐯𝐨𝐢𝐝𝐬 𝐞𝐱𝐭𝐫𝐚 𝐜𝐚𝐥𝐜𝐮𝐥𝐚𝐭𝐢𝐨𝐧𝐬 𝐚𝐧𝐝 𝐢𝐦𝐩𝐫𝐨𝐯𝐞𝐬 𝐩𝐞𝐫𝐟𝐨𝐫𝐦𝐚𝐧𝐜𝐞. That’s why most languages follow 0-based indexing. #java #coding #developer #learning #springboot

🚀 Day 65/180 | #180DaysOfCode 📍 LeetCode | 💻 Java Solved: 2535. Difference Between Element Sum and Digit Sum of an Array Used a single loop + digit extraction approach to calculate both element sum and digit sum efficiently. ⏱️ Time Complexity: O(n × d) 📦 Space Complexity: O(1) Strengthening understanding of number manipulation and digit-based operations. 💪 Consistency continues 🚀 #DSA #LeetCode #Java #CodingJourney #Consistency

Day 35/100 – Exploring ListIterator in Java 🔁 Today I explored the use of ListIterator in Java while working with ArrayList. Unlike a normal iterator, ListIterator allows traversal in both directions, making it more flexible when working with lists. Key learnings: • Traverse elements using next() • Move backward using previous() • Check elements using hasNext() and hasPrevious() • Useful for bidirectional iteration and modifications Understanding different ways to iterate through data structures helps in writing more efficient and flexible code. Learning something new every day, one step at a time. 🚀 #100DaysOfCode #Java #ArrayList #DataStructures #CodingJourney #LearningInPublic

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