NeetCode 29 | LeetCode #153 | Find Minimum in Rotated Sorted Array Used binary search to find the rotation pivot. Compared nums[mid] with nums[right] to shrink search space efficiently. Time complexity: O(log n) | Space: O(1) #LeetCode #NeetCode #Java #Algorithms #DataStructures #Optimization #Coding

NeetCode 32 | LeetCode #21 | Merge Two Sorted Lists Used a dummy node and pointers to iteratively merge two lists in O(n + m) time and O(1) space. Also explored recursion for a cleaner, elegant solution. #LeetCode #NeetCode #Java #DataStructures #Algorithms #Optimization #Coding

NeetCode 30 | LeetCode #33 | Search in Rotated Sorted Array Implemented modified binary search logic: Determine which side is sorted Adjust search boundaries based on the target’s position Time: O(log n) | Space: O(1) #LeetCode #NeetCode #Java #Algorithms #DataStructures #Optimization #Coding

NeetCode 33 | LeetCode #141 | Linked List Cycle Detection Used two pointers moving at different speeds: If they meet → cycle exists If the fast pointer reaches null → no cycle Efficient and elegant solution for a common linked list problem. #LeetCode #NeetCode #Java #Algorithms #DataStructures #Optimization #Coding

✅Day 71 of #100DaysOfLeetCode 1.📌Problem: Number of 1 Bits Given a positive integer n, write a function that returns the number of set bits in its binary representation (also known as the Hamming weight). 2.🟢 Difficulty: Easy 3.📍Topic: Bit Manipulation 4.🎯 Goal: Find the number of '1' bits present in the binary representation of the given integer n. 5.🧠 Key idea: Approach 1: Keep dividing n by 2 and count if the remainder is 1. This counts the number of 1's in binary form by repeatedly checking and incrementing a counter. A simple while-loop approach that efficiently solves the problem for any positive integer n.image.jpg #100DaysOfCode #LeetCode #CodingChallenge #BitManipulation #DataStructures #Algorithms #Java #Programming #Tech #CodeNewbie #InterviewPrep #LeetCodeEasy #ProblemSolving #LearnToCode #Developer

NeetCode 21 | LeetCode #76 | Minimum Window Substring Used two pointers and HashMaps to maintain a dynamic window tracking character frequencies. Achieved an optimized O(n) solution with careful window expansion and contraction logic. #NeetCode #LeetCode #Algorithms #Java #DataStructures #Optimization #Coding

✅Day 62 of #100DaysOfLeetCode 📌Problem: You are given a sorted array consisting of only integers where every element appears exactly twice, except for one element which appears exactly once. 🟠 Difficulty: Medium 📍Topic: Array, Binary Search 🎯 Goal: Return the single element that appears only once in O(log n) time and O(1) space. 🧠key idea: Approach 1: The problem can be efficiently solved using a modified binary search. The core logic relies on the properties of the sorted array. If we are at an even index, its duplicate pair should be at the next (odd) index. If we are at an odd index, its pair should be at the previous (even) index. By examining the middle element and its neighbor, we can determine if the single, non-duplicated element lies in the left or right half of the array, allowing us to discard one half in each step and achieve a logarithmic time complexity. #100DaysOfCode #LeetCode #CodingChallenge #Java #DataStructures #Algorithms #BinarySearch #ProblemSolving #SoftwareDeveloper #TechJobs #DeveloperLife #CodeNewbie #Programming #LearnToCode #JobSeekers

#Day13 2 – Add Two Numbers Solved this classic linked list problem by implementing an efficient algorithm to add two numbers represented as reverse-digit linked lists. 💡 Approach: Used a dummy node to simplify list construction, iterated through both lists while handling different lengths, and maintained a carry value for proper digit summation. The solution elegantly handles cases where lists have different sizes and final carry propagation. #LeetCode #Java #LinkedList #DataStructures #Algorithms #ProblemSolving #Coding #Tech #SoftwareEngineering #DailyCoding #Programming

✅Day 59 of #100DaysOfLeetCode 📌Problem: Given a fixed-length integer array arr, duplicate each occurrence of zero, shifting the remaining elements to the right. 🟢 Difficulty: Easy 📍Topic: Array 🎯 Goal: To modify the input array in place by duplicating every zero and shifting other elements accordingly, without returning anything. 🧠key idea: Approach 1: Create a new result array to hold the modified elements. Iterate through the original array; if the element is a zero, add it twice to the result array. Otherwise, add the element once. Finally, copy the contents of the result array back into the original array. #100DaysOfCode #LeetCode #CodingChallenge #Java #DataStructures #Algorithms #ProblemSolving #Developer #SoftwareEngineering #CodeNewbie #Tech #Programming #ArrayManipulation #DuplicateZeros #Day59

🚀 Day 47 of My LeetCode Journey 🚀 Problem: Sum of Square Numbers Topic: Math / Two Pointers 🧠 Approach: To check if a number c can be expressed as the sum of squares of two integers (a² + b² = c), we use the two-pointer technique: Start a = 0 and b = √c Calculate sum = a² + b² If sum == c → ✅ return true If sum < c → increase a If sum > c → decrease b Repeat until a <= b. ⏱️ Complexity: Time: O(√c) Space: O(1) This problem beautifully combines mathematical logic with an efficient two-pointer approach — clean and elegant! 💡 #100DaysOfCode #LeetCode #Java #CodingChallenge #ProblemSolving #DSA