Solved LeetCode problem: Steps to Zero with Simple Logic

📅 Day 51 of #100DaysOfCode Problem: Number of Substrings That Satisfy (LeetCode 3280) Approach: 1️⃣ Precomputed cumulative counts of 1s using a prefix sum array. 2️⃣ For each substring [i...j], calculated both the number of 0s and 1s. 3️⃣ Used a smart optimization: If (zero² > one), skip forward — those substrings can’t satisfy the condition. If (zero² == one) or (zero² < one), count and move ahead efficiently. 4️⃣ This drastically reduced redundant iterations compared to a naïve O(n³) brute force. #100DaysOfCode #LeetCode #DSA #ProblemSolving #Cplusplus #CodingChallenge #Algorithms #MathLogic #BinaryString #Programming #DeveloperLife #CodingJourney #CodeNewbie #DailyDSA #SoftwareEngineering #KeepLearning #GrowthMindset #Motivation #TechCommunity

On Day 287 of my #300daysofcode challenge, I'm sharing my solution to LeetCode Problem 2125, "Number of Laser Beams in a Bank." This problem is an excellent example of a linear-time problem that requires careful state tracking. My video provides a clear walkthrough of this efficient method, which is a valuable skill for any developer and a great way to practice writing clean, logical code. #DataStructures #Algorithms #LeetCode #CodingInterview #Programming #ProblemSolving #300daysofcode

🎯 Diving into the Command Pattern! Today I started learning about the Command Pattern from Head First Design Patterns, and it’s fascinating how elegantly it decouples the sender and receiver of a request. The idea is simple yet powerful — by encapsulating a request as an object, we can treat actions like data: 1. pass them around, 2. queue or log them, and 3. even undo them when needed! 🔄 It’s amazing how such patterns make our codebase more flexible, extensible, and easier to maintain — especially in real-world systems where we deal with lots of dynamic actions and user commands. Every new pattern feels like unlocking a new superpower for writing cleaner, smarter code! 💪 #CommandPattern #DesignPatterns #HeadFirstDesignPatterns #JavaDeveloper #SpringBoot #CleanCode #SoftwareEngineering #CodingJourney #LearningInPublic #Programming #Tech #Developers

🚀 Day 62 of LeetCode150DaysChallenge Problem: Rotate a Linked List Right #DSA #LeetCode #CodingChallenge #LinkedList #C++ #Programming #150DaysOfCode #LearnDSA #SDEJourney Topic: Linked List Given the head of a linked list, we need to rotate it to the right by k places. Similar to rotate an array by k elements For example: Input: 1 → 2 → 3 → 4 → 5, k = 2 Output: 4 → 5 → 1 → 2 → 3 🔍 Intuition: Rotating a linked list is basically bringing the last k nodes to the front. To do that efficiently, we need to understand: The length (n) of the list. The point of split (at position n - k). Reconnect the parts properly. 🧠 Step-by-Step Approach: Find the length of the list. Compute k = k % n to handle rotations larger than the list size. Break the list at the (n - k)th node. Reverse both halves for easier concatenation. Join them, and finally reverse the whole list back to get the rotated version. This clever use of the reverse operation avoids complex pointer adjustments! ⏱️ Time Complexity: O(n) – one traversal to find length, and a few reversals. 💾 Space Complexity: O(1) – in-place manipulation. 💡 Key Takeaway: This problem beautifully shows how reversing sublists can simplify complex pointer operations. Mastering linked list manipulations like these builds strong problem-solving intuition! 💪

On Day 285 of my #300daysofcode challenge, I'm sharing my solution to LeetCode Problem 2048, "Next Greater Numerically Balanced Number." This problem requires a focused iterative search and a helper function to verify the unique "balanced" property (where each digit $d$ appears $d$ times). My video provides a clear walkthrough of this logical method, a valuable skill for any developer and a great way to practice writing clean, reusable validation code. #DataStructures #Algorithms #LeetCode #CodingInterview #Programming #ProblemSolving #300daysofcode

From Arrays and Linked Lists to Graphs and Tries, each structure organizes data differently and serves unique real-world purposes — from managing browser history and social networks to building file systems and dictionaries. Whether you’re coding algorithms or optimizing applications, knowing when to use the right structure makes all the difference. Start small, visualize often, and build your foundation strong. 💡 #DataStructures #Programming #SoftwareEngineering #LearnToCode #TechEducation

Optimizing Path Traversal with Path Compression 🔄 Join Richard Feldman to demystify type inference by building it yourself. Implement the Hindley-Milner system, parse code, resolve scope, generate bytecode, and create a type system from scratch. https://lnkd.in/gQ2iHXFw #WebDev #Programming #Coding #LearnToCode #CompilerDesign

📅 Day 32 of #100DaysOfCode Problem: Design HashSet (LeetCode 705) Approach: 1️⃣ Used a boolean vector of fixed size (1,000,001) to represent presence or absence of elements directly by index. 2️⃣ add(key) marks the key as true, meaning it’s present in the set. 3️⃣ remove(key) simply resets the value to false. 4️⃣ contains(key) checks presence in O(1) time using direct indexing — super efficient and clean! #100DaysOfCode #LeetCode #DSA #ProblemSolving #Cplusplus #CodingChallenge #HashSet #DataStructures #Algorithms #CodeNewbie #Programming #DeveloperLife #SoftwareEngineering #LearningInPublic #TechCommunity #KeepLearning #CodingJourney #Motivation #Efficiency

💡 Day 84 of My LeetCode Journey – Problem 1614: Maximum Nesting Depth of Parentheses Today’s problem tested my understanding of stack concepts and string traversal — determining how deeply parentheses are nested in a given string. 🧠 Concept: The idea is simple yet elegant: Traverse the string character by character. Use a counter to track the number of open parentheses (. Update the maximum depth whenever the count increases. Decrease the counter when a closing parenthesis ) appears. Example: "(1+(2*3)+((8)/4))+1" → Maximum depth = 3 ✅ Key Takeaways: Strengthened understanding of parentheses matching and depth counting. Improved ability to simulate stack behavior without extra space. Reinforced skills in clean logic implementation and iteration control. Small yet powerful problems like this sharpen clarity, precision, and logical thinking 🧩 #LeetCode #ProblemSolving #100DaysOfCode #DSA #CodingChallenge #Programming #LogicBuilding #Cplusplus #DailyCoding #LearningEveryday

On Day 304 of the coding journey, I'm sharing my solution to LeetCode Problem 852, "Peak Index in a Mountain Array." This problem is a great test of recognizing and leveraging the monotonic property inherent in the array's structure. My video provides a clear walkthrough of the Binary Search adaptation, which is a valuable skill for technical interviews and essential for solving problems in $O(\log N)$ time. #DataStructures #Algorithms #LeetCode #CodingInterview #Programming #BinarySearch #Optimization