NeetCode 19 | LeetCode #424 | Longest Repeating Character Replacement Applied the sliding window technique to find the longest substring after at most k replacements. A great exercise in balancing frequency tracking and window expansion efficiently. #NeetCode #LeetCode #Java #DSA #Algorithms #SlidingWindow #ProblemSolving #CodingJourney

NeetCode 20 | LeetCode #567 | Permutation in String Applied sliding window with character frequency tracking to efficiently check for permutations in a string. A great exercise in combining logic, hash maps, and window optimization. #NeetCode #LeetCode #Java #DSA #Algorithms #SlidingWindow #ProblemSolving #CodingJourney

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

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

NeetCode 14 | LeetCode #11 | Container With Most Water Solved using the two-pointer approach — expanding and shrinking boundaries to find the maximum area efficiently in O(n) time. A great example of how logical movement can outperform brute force. #NeetCode #LeetCode #Java #DSA #Algorithms #TwoPointers #ProblemSolving #CodingJourney

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

NeetCode 43 | LeetCode #104 | Maximum Depth of Binary Tree Even though it’s one of the simpler tree problems, it’s such a solid way to understand recursion properly 🌳 Just find the max between left and right depth and add 1 — that’s it! But it really builds your foundation for all future tree questions 💪 #NeetCode #LeetCode #DSA #Java #BinaryTree #Recursion #ProblemSolving #CodingJourney

NeetCode 35 | LeetCode #19 | Remove Nth Node From End of Linked List yadd ki batt - HAMESHA AK DUMMY POINTER SE HE SLOW AND FAST POINTER KO POINT KARANA; One of those clean logic questions — just two pointers and perfect timing 😎 That fast–slow pointer trick never fails! Simple concept but teaches you so much about pointer control and edge cases. #NeetCode #LeetCode #DSA #Java #LinkedList #ProblemSolving

🚀 Day 140 of #150DaysOfCode on LeetCode Solved: 1526. Minimum Number of Increments on Subarrays to Form a Target Array Language: Java The task was to determine the minimum number of subarray increment operations needed to build the target array from all zeros. 🔹 Intuition: Every time the current element is greater than the previous one, it means we need that many new operations to reach the next level. Decreases don’t add extra work since earlier increments already cover them. 🔹 Approach: Start with the first element’s value as the initial count. For each subsequent element, if it’s larger than the previous one, add the difference. The sum of all such differences gives the minimum number of operations required. 🔹 Complexity: Time: O(n) Space: O(1) #LeetCode #150DaysOfCode #Java #CodingChallenge #ProblemSolving #Greedy #Arrays #DSA #TechLearning #Programmer #WomenInTech #CodeJourney #DynamicProgramming

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