LeetCode 3130: Binary Array Consecutive Limit Problem

Solved LeetCode 1009 – Complement of Base 10 Integer today. In simple terms, the problem asks us to flip every bit of a number’s binary representation — change all 0s to 1s and all 1s to 0s — and then convert it back to a decimal number. The key idea was to create a bit mask of all 1s with the same length as the number’s binary form, and then use the XOR (^) operation to flip the bits. A small problem, but a good reminder of how powerful bit manipulation can be in programming. #LeetCode #DSA #Java #CodingJourney #ProblemSolving

Day 10 of LeetCode Today I tackled one of the classic dynamic programming challenges — Regular Expression Matching. The problem involves matching a string with a pattern that includes: matches any single character matches zero or more of the preceding element Approach: Built a 2D DP table where dp[i][j] represents whether substring s[0..i-1] matches p[0..j-1] Carefully handled * with two cases: Zero occurrence One or more occurrences Initialized edge cases for patterns like a*, a*b* Result: Accepted with optimal performance! This problem really strengthens understanding of: Pattern matching DP state transitions Edge case handling Consistency is key — one hard problem at a time #LeetCode #DataStructures #Algorithms #DynamicProgramming #Java #CodingJourney #ProblemSolving

Day 11/100 Day Coding Challenge Today, I solved the LeetCode problem: Container With Most Water using Java. Here’s a detailed breakdown of my approach and learning: Problem Statement: Given an array of non-negative integers representing heights of vertical lines on a coordinate plane, find two lines that, along with the x-axis, form a container that holds the maximum water. Challenges: A brute-force approach would check all possible pairs of lines (O(n²)), which is inefficient for large arrays. I aimed for an optimized solution using the two-pointer technique. Approach (Two-Pointer Technique): Initialize two pointers: l at the start, r at the end of the array. Compute the current area: curWater = (r - l) * min(height[l], height[r]). Update maximum area found so far. Move the pointer pointing to the shorter line inward: If height[l] < height[r], increment l. Else, decrement r. Repeat until the pointers meet. #100DaysOfCode #Java #LeetCode #TwoPointerTechnique #ProblemSolving #Algorithms #SoftwareEngineering #Day11

🚀 Day 61/100 – LeetCode Challenge ✅ Solved: 125. Valid Palindrome Today’s problem was all about string manipulation + two-pointer technique. 🔍 Approach: Ignored all non-alphanumeric characters Converted characters to lowercase Used two pointers (left & right) to compare characters If mismatch → not a palindrome 💡 Key Learning: Instead of creating a new string, using the two-pointer approach helps achieve O(1) space complexity, making the solution more efficient. ⚡ Performance: Runtime: 2 ms (Beats 99.35%) Memory: 44 MB 🔥 Small problem, but a great reminder that clean logic + optimization matters! #Day61 #LeetCode #100DaysOfCode #Java #CodingJourney #ProblemSolving #TechGrowth

🚀 LeetCode Daily Challenge – Day 30 Today I solved LeetCode 1009 – Complement of Base 10 Integer. 📌 Approach: 1️⃣ Convert the number to binary (conceptually). 2️⃣ Flip all bits (0 → 1 and 1 → 0). 3️⃣ Convert the result back to decimal. Instead of actually converting to binary, we create a mask of all 1s having the same length as n and then use XOR. Example: n = 5 → binary 101 Complement → 010 → decimal 2 📈 Complexity Time: O(log n) Space: O(1) Every problem solved strengthens problem-solving skills and understanding of bit manipulation. #LeetCode #DSA #ProblemSolving #Java #CodingJourney #75DaysOfCode

LeetCode Problem || Find All Possible Stable Binary Arrays I(3129)🚀. Today I worked on the problem "Number of Stable Arrays". A stable array is an array consisting of 0s and 1s where we cannot place more than limit consecutive identical elements. 🔹 Key Idea To solve this, I used Recursion + Dynamic Programming (Memoization). The state of the problem depends on: Remaining zeros Remaining ones The last bit placed in the array The current streak (how many times the same bit has appeared consecutively) So the stored results in a 4D DP array Consistent practice on data structures and algorithms is helping me strengthen my problem-solving skills every day. #LeetCode #DynamicProgramming #Recursion #CodingPractice #DSA #Java

Day 93 - LeetCode Journey Solved LeetCode 9: Palindrome Number in Java ✅ At first glance, it feels like a string problem… but the real challenge is solving it without converting to string. Instead of reversing the whole number, I reversed only half of it and compared both parts. This avoids overflow and keeps it efficient. Smart approach > brute force 💡 Key takeaways: • Handling edge cases (negative numbers, trailing zeroes) • Reversing only half of the number • Avoiding extra space (no string conversion) • Writing optimized mathematical logic ✅ All test cases passed ⚡ O(log n) time and O(1) space Sometimes the best solutions are the simplest ones, just a different way of thinking 🔥 #LeetCode #DSA #Java #Math #ProblemSolving #CodingJourney #InterviewPrep #Consistency #100DaysOfCode

🚀 Day 58 — LeetCode Practice 🚀 Today’s problem: Shuffle String (LeetCode 1528) 💡 Key Learning: • Learned how to rearrange characters using index mapping • Understood how placing elements at correct positions simplifies the problem • Practiced writing clean and efficient O(n) solutions • Strengthened thinking for array + string manipulation 🧠 Approach in simple words: Instead of modifying the original string, create a new array and place each character at its correct index using the given indices. ✨ Takeaway: Sometimes the simplest idea — “put the element in its right place” — gives the most optimal solution. Consistency is the real game 💪 #Day58 #LeetCode #DSA #CodingJourney #Java #Consistency #ProblemSolving

Day 56 : Crushing Binary Trees on LeetCode 💡 Today’s live practical session in Alpha Plus 7.0 We focused on some of the most challenging Binary Tree questions on LeetCode, breaking down the logic behind them. What I practiced today: ✅ Tree Diameter: understand the logic to calculate the absolute longest path between any two nodes in the entire tree. ✅ Maximum Path Sum: Tackled a famous "Hard" level problem! Figured out how to find the path with the highest possible sum, even if it doesn't pass through the root. ✅ Target Deletion: Wrote the recursive code to systematically find and delete leaf nodes that match a specific target value. #BinaryTree #LeetCode #ProblemSolving #DSA #Java #SoftwareEngineering #100DaysOfCode #ApnaCollege