🚀 Day 68 of #100DaysOfDSA. Today, I explored stack concepts:.✅ Reverse a stack.✅ Push an element at the bottom or any index.✅ Reverse a stack using recursion.✅ Push an element at the bottom recursively. Solved LeetCode POTD:.🔹 2411. Smallest Subarrays With Maximum Bitwise

🚀 Day 33 of #100DaysOfCode. ✅ Solved: Leetcode 907 – Sum of Subarray Minimums.📊 Used monotonic stacks to optimize brute-force O(n²) ➝ O(n).Approach:. For each element arr[i], calculate how many subarrays it is the minimum in. #Leetcode #DSA #Codeforces #Coding

✅ Solved LeetCode POTD: Number of Zero-Filled Subarrays. 🔎 Problem Summary:.Given an array nums, count subarrays containing only zeros. A subarray is a contiguous, non-empty sequence of elements. 🧠 Approach:.Iterate through the array. Track consecutive zeros with a counter,

🚀Day 57 of #100DaysOfCode.Problem: Count subarrays with a given sum.• Approch : Using prefix sums + hashing to efficiently track and count valid subarrays .• Time Complexity : O(n). #DSA #Cpp #PrefixSum #Hashing #ProblemSolving #Leetcode

Day 77 of #100DaysOfCode.🔠Solved Longest Repeating Character Replacement – applied sliding window + frequency tracking. 💡Also tackled Binary Subarray With Sum – required careful window management to count subarrays. #DSA #LeetCode #ProblemSolving #SlidingWindow #CodingInterview

Day 20/100 — #100DaysOfCode.Solved Leetcode 3480: tricky but satisfying!.Learned how to handle conflicts in subarrays for max results. #Leetcode #Coding #Python #CodeNewbie

🚀 Day 3 of #100DaysOfCode.📌 Solved Leetcode 2411 - Smallest Subarrays With Maximum Bitwise OR.🧠 Learned how to optimize using bit manipulation and reverse traversal.⚙️ C++ used | Tags: #BitwiseOR #SlidingWindow #Greedy.#Leetcode #DevJourney #DSA #100DaysChallenge

LeetCode 2348.—Number of Zero-Filled Subarrays(Python). ✅ Incremental Streak Counter.✅ Count new zero-subarrays on the fly.✅ O(1) extra space.⏱Time:O(n) | Space:O(1). Solution:. #Python #LeetCode #100DaysOfCode #DSA #POTD #Programming #LearnInPublic

✅ Solved LeetCode POTD – 2411. Smallest Subarrays With Maximum Bitwise OR. I solved today’s LeetCode Problem of the Day, a bit manipulation problem focusing on prefix subarrays and OR operations. 🔍 Approach:.- Created a last[30] array to track the rightmost index of each bit

🚀 Day 372 of Code 🚀. Solved :. ✅ 898. Bitwise ORs of Subarrays. #Day372 #LeetCode #BitManipulation #DSA #ProblemSolving #CodingDaily #TechLearning #SlidingWindow #SetOptimization #100DaysOfCode

Day 17 of DSA Practice .✅2411. Smallest Subarrays With Maximum Bitwise OR (LeetCode) .#DSA #LeetCode #GFG2025 #100daysofcodechallenge #CodingJourney #codinglife #ProblemSolving #Connections #follower #pythonprogramming #solutionsforyou

Day 168/365 #code. ✅ Maximize Subarrays After Removing One Conflicting Pair. Day 105/160 #gfg160.✅Get Min from Stack. #gfg160 #GeeksforGeeks #DSA #Consistency #Leetcode #Coding #ProblemSolving

Day 108 max of subArrays | #gfg160 #DSA #geekstreak2025 #GFG #gfg160daychallenge.@geeksforgeeks

📌 Day 120 of #365DaysOfCode.🎯 DSA:.✅Maximum Binary Tree.✅Count Complete Subarrays.✅Gold Mine Problem. 🌐 Web Dev.✅ Started learning JavaScript DOM. #DSA #Leetcode #letsconnect #WebDevelopment #CodingJourney #BuildInPublic #LearnInPublic

📌 Day 118 of #365DaysOfCode.🎯 DSA:.✅ Count Nice Subarrays.✅ Largest Odd Number in String.✅ Find the Longest String. 🌐Web Dev.✅Started JavaScript!.✅Learned Data Types, Loops, Conditionals. Let's connect 🤝. #LeetCode #DSA #CodingJourney #BuildInPublic #LearnInPublic

[POTD].Today's LeetCode 2348:.— Number of Zero-Filled Subarrays (Python). ✅ Incremental Streak Counter.✅ Count new zero-subarrays on the fly.⏱Time: O(n) | Space: O(1). Solution:. #Python #LeetCode #100DaysOfCode #DSA #Coding #Programming #LearnInPublic

Day 173 /365 #code. ✅ Bitwise ORs of Subarrays. Day 110/160 #gfg160.✅Longest Increasing Subsequence. #gfg160 #GeeksforGeeks #DSA #Consistency #Leetcode #Coding #ProblemSolving

Problem of the day -> day 297 .problem: Subarrays With At Most K Distinct Integers.@geeksforgeeks.#day297 #geekstreak2025 #potd

Day 207/360 of DSA challange 🧑‍💻. Today I solved 1 DSA Questions on @LeetCode.1). Maximize Subarrays After Removing One Conflicting Pair. #DSA #LeetCode #datastructures .#LeetCode .#FAANG

Day 212/360 of DSA challange 🧑‍💻. Today I solved 1 DSA Questions on @LeetCode.1). Bitwise ORs of Subarrays. #DSA #LeetCode #datastructures .#LeetCode .#FAANG