Count Binary Substrings with Consecutive Pattern Tracking

Day: 45/365 📌 LeetCode POTD: Special Binary String Hard Key takeaways/Learnings from this problem: 1. This one teaches that recognizing a balanced structure (like valid parentheses) inside a binary string is the real trick. 2. Big takeaway: recursion + sorting substrings smartly can turn a complex greedy-looking problem into something surprisingly elegant. #POTD #365DaysOfCode #DSA #Java #ProblemSolving #LearningInPublic #Consistency 🥷

Day: 72/365 📌 LeetCode POTD: Count Submatrices With Equal Frequency of X and Y Medium Key takeaways/Learnings from this problem: 1. The key idea is converting the problem into numbers (like +1 and -1) so equal frequency turns into a sum = 0 problem. 2. 2D prefix sums really help here—you can quickly get submatrix sums without recalculating every time. 3. It’s a nice extension of 1D subarray problems to 2D, so knowing those basics pays off big time. #POTD #365DaysOfCode #DSA #Java #ProblemSolving #LearningInPublic #Consistency 🥷

𝐃𝐚𝐲 𝟒𝟕/𝟑𝟔𝟓 🚀 📌 𝐋𝐞𝐞𝐭𝐂𝐨𝐝𝐞 𝐏𝐎𝐓𝐃: 𝐂𝐡𝐞𝐜𝐤 𝐢𝐟 𝐁𝐢𝐧𝐚𝐫𝐲 𝐒𝐭𝐫𝐢𝐧𝐠 𝐇𝐚𝐬 𝐚𝐭 𝐌𝐨𝐬𝐭 𝐎𝐧𝐞 𝐒𝐞𝐠𝐦𝐞𝐧𝐭 𝐨𝐟 𝐎𝐧𝐞𝐬 Continuing my 𝟑𝟔𝟓 𝐃𝐚𝐲𝐬 𝐨𝐟 𝐂𝐨𝐝𝐞 journey with a focus on 𝐩𝐫𝐨𝐛𝐥𝐞𝐦-𝐬𝐨𝐥𝐯𝐢𝐧𝐠, 𝐃𝐒𝐀, 𝐚𝐧𝐝 𝐜𝐨𝐧𝐬𝐢𝐬𝐭𝐞𝐧𝐜𝐲. 💪 🔎 𝐀𝐩𝐩𝐫𝐨𝐚𝐜𝐡: A valid binary string can contain only one continuous segment of 1s. If the pattern "01" appears, it means a new segment of 1s starts after zeros, which violates the condition. 🔍 𝐀𝐥𝐠𝐨𝐫𝐢𝐭𝐡𝐦 𝐮𝐬𝐞𝐝: String pattern detection. ⏱ 𝐓𝐢𝐦𝐞 𝐂𝐨𝐦𝐩𝐥𝐞𝐱𝐢𝐭𝐲: 𝐎(𝐧) 🧠 𝐒𝐩𝐚𝐜𝐞 𝐂𝐨𝐦𝐩𝐥𝐞𝐱𝐢𝐭𝐲: 𝐎(𝟏) 📈 𝐊𝐞𝐲 𝐭𝐚𝐤𝐞𝐚𝐰𝐚𝐲: Sometimes the simplest solution comes from recognizing a pattern rather than iterating through complex conditions. #LeetCode #LeetCodeDaily #365DaysOfCode #DSA #Java #Strings #ProblemSolving #LearningInPublic 👨💻 🔗 Problem link in comments 👇

🚀 Day 31/180 | #180DaysOfCode 📍 LeetCode | 💻 Java Solved: 69. Sqrt(x) Used the Binary Search approach to find the integer square root without using built-in power functions. The search space is reduced by checking mid * mid against x. ⏱️ Time Complexity: O(log n) 📦 Space Complexity: O(1) Strengthening problem-solving skills with binary search patterns on answer space. 💪 Consistency continues 🚀 #DSA #LeetCode #Java #CodingJourney #Consistency

🚀 Day 18/180 | #180DaysOfCode 📍 LeetCode | 💻 Java Solved: 1528. Shuffle String Used a direct indexing approach by placing each character at its correct position using the given indices array. ⏱️ Time Complexity: O(n) 📦 Space Complexity: O(n) A simple yet important problem to strengthen understanding of arrays and index mapping. 💪 Consistency continues 🚀 #DSA #LeetCode #Java #CodingJourney #Consistency

Day: 52/365 📌 LeetCode POTD: Minimum Operations to Equalize Binary String Level: Hard Key takeaways/Learnings from this problem: 1. This one really makes you think in terms of mismatched positions instead of raw characters. 2. Greedy feels tempting, but you need to carefully compare operation costs before deciding what to fix first. 3. It’s a good reminder that binary string problems often reduce to counting patterns smartly. 4. Biggest takeaway: always try to simplify the string into a difference representation — the solution usually becomes much clearer. #POTD #365DaysOfCode #DSA #Java #ProblemSolving #LearningInPublic #Consistency 🥷

LeetCode Problem || Check if Binary String Has at Most One Segment of Ones(1784)🚀 we need to check: The string should have only one continuous block of '1's. After a '0' appears, '1' should never appear again. ✨ Insight: Instead of manually counting segments using loops, we can simply check if "01" exists in the string. 📌 Time Complexity: O(n) Practicing problems like these helps improve pattern recognition and problem-solving efficiency. #LeetCode #DSA #Java #CodingPractice #ProblemSolving

Day: 71/365 📌 LeetCode POTD: Count Submatrices with Top-Left Element and Sum Less Than k Medium Key takeaways/Learnings from this problem: 1. Prefix sum is the hero here—once you precompute it, submatrix sum becomes instant lookup instead of recomputing every time. 2. Fixing the top-left corner simplifies things a lot, turning a 2D problem into something more manageable. 3. Instead of brute forcing all submatrices, you just expand and check smartly using precomputed sums. #POTD #365DaysOfCode #DSA #Java #ProblemSolving #LearningInPublic #Consistency 🥷

🚀 Day 24/180 | #180DaysOfCode 📍 LeetCode | 💻 Java Solved: 2859. Sum of Values at Indices With K Set Bits Used bit manipulation to count the number of set bits in each index and summed the values whose index contains exactly k set bits. ⏱️ Time Complexity: O(n log n) 📦 Space Complexity: O(1) Strengthening understanding of bitwise operations and binary representation through consistent practice. 💪 Consistency continues 🚀 #DSA #LeetCode #Java #CodingJourney #Consistency

🚀 Day 20/180 | #180DaysOfCode 📍 LeetCode | 💻 Java Solved: 350. Intersection of Two Arrays II Used sorting + two-pointer technique to efficiently find common elements appearing in both arrays while maintaining correct frequency. ⏱️ Time Complexity: O(n log n + m log m) 📦 Space Complexity: O(min(n, m)) (for storing the intersection) Strengthening understanding of array traversal and two-pointer pattern through consistent practice. 💪 Consistency keeps the progress moving 🚀 #DSA #LeetCode #Java #CodingJourney #Consistency