Misa Codes

Day 20 #30DaysOfDev 🚀 Onboarding pipeline: Operational. Just wrapped up the rider registration interface. It grabs location data and handles profile state updates smoothly. Next step is wiring up the real-time order notification mechanics! #100DaysOfCode #webdev #NodeJS #MERN

Set the lowest boundary to `max_element` and the highest to `accumulate`. Bisect boundaries via Binary Search. A greedy helper (`canPaint`) checks threshold validity at `mid`. If true, we record the time state and squeeze left to target a smaller minimized bottleneck!

Day 67/75 #75HardCoding | Monotonic Min-Max Search Smashed "The Painter's Partition Problem-II" optimally on GFG! Formulated the search space using identical predicate patterns from the book allocation framework. • TC: O(N * log(Sum - Max)) • Aux SC: O(1) #DSA #LeetCode #Cpp

Day 19 #30DaysOfDev 🚀 Moving into the logistics engine. Auth systems decoupled: Done. Restaurant portals active: Done. Today, the Rider registration service took off! The backend multi-part controllers are checking schemas securely down to geographic coordinate strings. #Web

Ensure nums1 is the smaller array to minimize the search space. We virtualize a binary search split across both arrays concurrently. Validate cuts by checking cross-over boundaries (l1 <= r2 && l2 <= r1). If violated, we binary shift the window. Pure O(log(min(M, N))) efficiency!

Day 66/75 #75HardCoding | Logarithmic Array Partitioning Maxed LeetCode 4 (Median of Two Sorted Arrays) optimally! Replaced pointer merging with a binary search sweep over the smaller array partition split. • Time Complexity: O(log(min(M, N))) • Space Complexity: O(1) Aux SC

•Brute:Uses standard MergeSort ptr layout to create a new combined array container,resolving idxes linearly. •Better:Keeps the linear merge check but eliminate the extra memry buffer completely.We track idxes virtually using a counter `cnt` to capture only the median positions

Day 65/75 #75HardCoding | Virtual Matrix Merging Conquered LeetCode 4 (Median of Two Sorted Arrays) across two structural implementation layers: 1️⃣ Brute: O(m+n) TC | O(m+n) SC ↳ Array Allocation 2️⃣ Better: O(m+n) TC | O(1) Aux SC ↳ Constant Pointers #DSA #LeetCode #Cpp

Day 18 #30DaysOfDev 🚀 The restaurant dashboard is now tracking incoming orders in 100% real time. Status flows update dynamically, audio cues fire on point, and WebSockets are half integrated. Getting closer to the finish line! ✨ #MERN #buildinpublic #frontend #backend #JS

Day 17 #30DaysOfDev 🚀 Setting the stage for real-time tracking. Laid down the foundations for WebSockets today. The backend server initialization and auth gateway hooks are up and ready. Full client integration pipeline drops next! #100DaysOfCode #BuildInPublic #NodeJS #MERN

• The Strategy: Initialize head (`i = 0`) and tail (`j = s.size() - 1`) pointers. • Mechanics: Inner loops bypass non-vowel characters quickly using a static case-insulated match array. When both pointers land on vowels, swap `s[i]` and `s[j]` in-place and step inward.

Day 64/75 #75HardCoding | Two-Pointer Inward Swaps Solved LeetCode 345 (Reverse Vowels of a String) optimally using an in-place dual-pointer sequence scan. • Time Complexity: O(N) • Auxiliary Space: O(1) Constant Space #DSA #LeetCode #Cpp #DataStructures #Consistency #GFG

Day 16 #30DaysOfDev 🚀 Massive milestone unlocked today! Successfully wired up Docker, configured RabbitMQ for asynchronous event decoupled flows, and completely integrated the Razorpay pipeline. The checkout page is now running incredibly smooth. #buildinpublic #webdev #MERN

Day 63/75 #75HardCoding | LeetCode Hard Maxed! Smashed LeetCode 410 (Split Array Largest Sum) optimally. Recognized the exact monotonic pattern from the book allocation framework! • Time Complexity: O(N * log(Sum - Max)) • Space Complexity: O(1) Aux SC #DSA #LeetCode #Cpp

Day 62/75 #75HardCoding | Pigeonhole Optimization Evolved LeetCode 3046 (Split the Array) across 3 distinct algorithmic tiers: 1️⃣Brute: O(N²) TC | O(1) SC ↳ Nested lookup loops 2️⃣Better: O(N) TC | O(N) SC ↳ Unordered Map 3️⃣Optimal: O(N) TC | O(1) Aux SC #DSA #LeetCode #Cpp

Day 15 #30DaysOfDev 🚀 Restaurant Menu Management is completely complete! Sellers can now seamlessly view, add, delete, and toggle menu item availability status dynamically in real-time. 📝🍟 All microservices synced up perfectly! #buildinpublic #mernstack #reactjs #typescript

• The Leap: A linear sweep through this range TLEs. Bisecting the range via Binary Search lets a greedy helper (`possibleAllocation`) pinpoint the optimal threshold in O(log(Range)) loops!

• The Strategy: To minimize the maximum pages a student reads, the lowest possible answer is `max_element` (at least one book) and the highest is `accumulate` (all books).

Day 61/75 #75HardCoding | Binary Search on Answer Solved "Allocate Minimum Pages" problem, optimizing a complex min-max minimization search space! • Brute: O((Sum - Max) * N) TC | O(1) SC • Optimal: O(N * log(Sum - Max)) TC | O(1) SC #DSA #LeetCode #Cpp #GFG #DataStructures

Day 14 #30DaysOfDev 🚀 Menu Management is fully live! Added menu item creation and live availability toggles with 0 page reloads. Form uploads form-data to Cloudinary, handles strict type guards, and syncs parent arrays instantly on updates. #buildinpublic #mern #reactjs #ts