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

🔹 Day 39 – LeetCode Practice Problem: Perfect Number (LeetCode #507) 📌 Problem Statement: A perfect number is a positive integer that is equal to the sum of its positive divisors, excluding itself. Return true if the given number is perfect, otherwise return false. ✅ My Approach (Java): Initialize sum = 0. Iterate from 1 to num / 2. For every divisor i such that num % i == 0, add it to sum. After the loop, if sum == num, it’s a perfect number. 📊 Complexity: Time Complexity: O(n/2) Space Complexity: O(1) ⚡ Submission Results: Accepted ✅ Runtime: 2108 ms Memory: 41.19 MB 💡 Reflection: This problem reinforced the importance of divisor-based iteration. While this brute-force solution works, optimizing divisor checks using square roots can greatly improve performance — a good next step for refinement! #LeetCode #ProblemSolving #Java #DSA #CodingPractice #Learning

NeetCode 18 | LeetCode #3 | Longest Substring Without Repeating Characters Applied the sliding window technique to efficiently track unique characters and find the longest substring in O(n) time. A great exercise in optimizing logic and managing state effectively. #NeetCode #LeetCode #Java #DSA #Algorithms #SlidingWindow #ProblemSolving #CodingJourney

🚀 Day 7️⃣0️⃣ of #100DaysOfCode Solved LeetCode Problem #2169 — Count Operations to Obtain Zero ⚙️💡 Logic: In this problem, we repeatedly subtract the smaller number from the larger one until one of them becomes zero. If num1 >= num2, subtract num2 from num1. Else, subtract num1 from num2. Increment the operation count each time. Continue until either num1 or num2 becomes 0. 💭 Simple yet logical — one of those problems that tests clarity of thought over complexity. #LeetCode #Java #100DaysOfCode #ProblemSolving #CodingJourney #LearnByDoing #DeveloperLife #LogicBuilding #TechCommunity #CodeDaily #KeepCoding

NeetCode 22 | LeetCode #20 | Valid Parentheses Simple yet fundamental — mastering stack operations to validate correct bracket sequences. A great reminder that clean logic and data structure fundamentals go a long way. #NeetCode #LeetCode #Java #DSA #Stack #Algorithms #ProblemSolving #CodingJourney

#Day403_DSA:Today I learned the LeetCode problem "Minimum Number of Operations to Make Array Empty". This question helped me understand how to efficiently use a PriorityQueue and a lazy subtraction technique to minimize operations. Instead of modifying every element, we can track the cumulative subtraction value to optimize performance. It was a great exercise in combining heap logic with mathematical thinking — improving both problem-solving speed and code efficiency. #LeetCode #Java #DSA #PriorityQueue #LearningJourney #RajVikramaditya #TakeUForward

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

Merge K Sorted Lists | NeetCode 41 | LeetCode #23 Efficient merging with a min-heap — clean, scalable, and optimal. A perfect problem to bridge LinkedList + Heap understanding. #NeetCode #LeetCode #DSA #Java #Heap #LinkedList #CodingJourney and yes i used gpt for help in this video..cze i was not sure about some things in between see you in another

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 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