How to handle integer overflow in Java with LeetCode

💻 LeetCode 50 Days Challenge — Day 8: Median of Two Sorted Arrays Day 8 of my #LeetCode50DaysChallenge ✅ Today’s problem was about finding the median of two sorted arrays — Median of Two Sorted Arrays ✨ 🧩 Problem: Given two sorted arrays nums1 and nums2, return the median of the two sorted arrays. The challenge was to merge them efficiently and then determine the middle value(s). 💡 Approach: I used Java 8 Streams to merge both arrays in a single line using IntStream.concat(), followed by Arrays.sort() to sort the combined array. Finally, I calculated the median by checking if the array length is even or odd. ⏱️ Time Complexity: O((m + n) log (m + n)) (due to sorting) 📊 Example: Input: nums1 = [1, 2], nums2 = [3, 4] Output: 2.5 Each day, I’m getting more comfortable with cleaner and modern Java techniques like Streams — small steps toward writing concise and efficient code 🚀 #LeetCode #CodingChallenge #Day8 #ProblemSolving #Java #SoftwareDevelopment #Consistency #50DaysOfCode

💻 LeetCode Challenge – Day 5: String to Integer (atoi) Today's problem was all about converting a string into an integer — seems simple, but the edge cases make it tricky! 🧠 🔹 Problem: Implement the atoi function, which converts a string to a 32-bit signed integer (just like in C/C++). 🔹 Key Learnings: ✅ Handling whitespaces and optional '+' or '-' signs ✅ Managing non-digit characters gracefully ✅ Preventing integer overflow & underflow ✅ Importance of clean parsing logic This problem really improved my understanding of string manipulation and boundary conditions in Java. 🚀 #LeetCode #100DaysOfCode #Java #CodingChallenge #ProblemSolving #StringToInteger #CodingJourney

📅 Days 57–64 of My Coding Journey — Diving Deep into Java Exception Handling, Threads & Real-World Projects 💻 Over the past week, I explored some of the most practical and powerful concepts in Java that take coding from theory to real-world application. 💡 Topics I covered: ✅ Exception Handling – mastering try-catch-finally blocks, and creating Custom Exceptions for cleaner error control. ✅ Multithreading – understanding how threads work, how to start and manage them efficiently. ✅ StringBuilder & StringBuffer – learning the difference between mutable classes and thread safety in string manipulation. ✅ Explored important String methods to handle text effectively. ✅ Built a Patient Management System 🏥 — implementing OOP principles, exceptions, and thread usage in one project. #Day57 #Day58 #Day59 #Day60 #Day61 #Day62 #Day63 #Day64 #Java #ExceptionHandling #Threads #StringBuilder #StringBuffer #OOPS #CodingJourney #SoftwareEngineering #100DaysOfCode #LearningInPublic #KunalKushwaha #ProblemSolving

🚀 Day 34 of 100 Days of LeetCode 📘 Problem: Merge Intervals 💻 Language: Java ✅ Status: Accepted — Runtime ⚡ 8 ms (Beats 86%) Today’s challenge was all about mastering interval merging, an essential concept for solving scheduling and range-based problems efficiently 🧩 By sorting intervals and carefully merging overlapping ones, I learned how crucial boundaries and comparisons are — both in coding and in life. ✨ Key Learnings: Sorting simplifies complex interval logic Smart use of conditions avoids unnecessary comparisons Handling edge cases builds precision thinking ⚙️ 💬 “Merge where it makes sense — in code and in life.” #Day34 #100DaysOfCode #LeetCode #Java #DSA #ProblemSolving #Algorithms #CodingJourney #SoftwareDevelopment #KeepLearning #CodeEveryday

🚀 Day 56 of my #100DaysOfLeetCode Challenge 🚀 Today's problem: Matrix Diagonal Sum Language: Java In this challenge, I practiced calculating the sum of both primary and secondary diagonals of a square matrix. The goal was to improve my understanding of nested loops and conditional logic for index-based problems. Key Takeaways: Strengthened logic for 2D array traversal Improved debugging and edge case handling Reinforced clean, readable code habits Here’s the core idea from my solution: If i == j (primary diagonal) or i + j == n - 1 (secondary diagonal), add that element to the sum. #LeetCode #Java #CodingChallenge #100DaysOfCode #ProblemSolving #SoftwareEngineering

💡 LeetCode 3467 – Transform Array 💡 Today, I solved LeetCode Problem #3467: Transform Array, which focuses on array manipulation and the use of conditional logic in Java — a neat problem that strengthens core programming fundamentals. ⚙️ 🧩 Problem Overview: You’re given an integer array nums. Your task is to: Replace even numbers with 0 Replace odd numbers with 1 Then, sort the transformed array in ascending order. 👉 Example: Input → nums = [4, 7, 2, 9] Output → [0, 0, 1, 1] 💡 Approach: 1️⃣ Iterate through the array. 2️⃣ Use a ternary operator to transform each element (even → 0, odd → 1). 3️⃣ Sort the array to arrange all zeros before ones. ⚙️ Complexity Analysis: ✅ Time Complexity: O(n log n) — due to sorting. ✅ Space Complexity: O(1) — in-place transformation. ✨ Key Takeaways: Practiced logical thinking and ternary operations in Java. Strengthened understanding of array transformations and sorting. Reinforced the value of writing clean, concise, and efficient code. 🌱 Reflection: Even simple transformation problems like this one sharpen the habit of thinking algorithmically. Consistency in small challenges leads to big growth in problem-solving skills. 🚀 #LeetCode #3467 #Java #ArrayManipulation #LogicBuilding #ProblemSolving #CodingJourney #DSA #CleanCode #ConsistencyIsKey

💡 LeetCode 1929 – Concatenation of Array 💡 Today, I solved LeetCode Problem #1929: Concatenation of Array, a simple yet satisfying problem that tests your understanding of array manipulation and indexing in Java. ⚙️📊 🧩 Problem Overview: You’re given an integer array nums. Your task is to create a new array ans such that ans = nums + nums (i.e., concatenate the array with itself). 👉 Example: Input → nums = [1,2,1] Output → [1,2,1,1,2,1] 💡 Approach: 1️⃣ Find the length n of the given array. 2️⃣ Create a new array of size 2 * n. 3️⃣ Loop through nums once — place each element both at index i and index n + i. 4️⃣ Return the resulting array. ⚙️ Complexity Analysis: ✅ Time Complexity: O(n) — Single traversal of the array. ✅ Space Complexity: O(n) — For the concatenated array. ✨ Key Takeaways: Practiced index manipulation and array construction. Reinforced the importance of efficient iteration. A great warm-up problem that strengthens logical thinking and array fundamentals. 🌱 Reflection: Even the simplest problems build the foundation for solving more complex ones. Every bit of consistent practice helps in mastering problem-solving and clean coding habits. 🚀 #LeetCode #1929 #Java #ArrayManipulation #DSA #CodingJourney #CleanCode #ProblemSolving #AlgorithmicThinking #ConsistencyIsKey

🧠 Daily LeetCode Grind — Java Edition Today’s challenge: ✅ Container With Most Water (#11 - Medium) 📌 Goal: Given an integer array height[], find two lines that, together with the x-axis, form a container that holds the most water. 📌 Approach: 🔹 Use the Two-Pointer Technique to optimize the search for the maximum area. 🔹 Start with two pointers at both ends of the array and calculate the area at each step. 🔹 Move the pointer pointing to the smaller height inward to maximize potential area. 🔹 Continue until both pointers meet. 🧩 Test Case: Input: height = [1,8,6,2,5,4,8,3,7] Output: 49 💡 Key Takeaways: 🔹 Learned to balance area optimization using width × height. 🔹 Reinforced the power of the two-pointer approach for reducing time complexity. 🔹 Strengthened problem-solving speed through mathematical reasoning. 💻 Language: Java 🧠 Complexity: O(n) — single pass using two pointers. #LeetCode #Java #CodingPractice #ProblemSolving #TwoPointer #Algorithm #DeveloperLife #CybernautEdTech #AcceptedSolution

NeetCode 35 | LeetCode #143 | Reorder Linked List This one’s all about mastering pointer manipulation! Steps I followed: 1️⃣ Find the middle using slow & fast pointers 2️⃣ Reverse the second half 3️⃣ Merge both halves alternately Such problems really sharpen understanding of linked list structure and in-place rearrangement. #NeetCode #LeetCode #Java #DSA #LinkedList #Algorithms #CodingJourney #ProblemSolving