LeetCode Challenge Day 13: Binary Search & Math Optimization

🚀 Day 15 of 100 Days LeetCode Challenge Problem: Fancy Sequence Today’s problem was a design + math optimization challenge 🔥 not your typical DSA question. 💡 Key Insight: Instead of updating all elements every time (O(n)), we delay operations using math. 👉 Maintain: A global multiplier (mul) A global increment (add) So every value is interpreted as: ➡️ actual_value = val * mul + add 🔍 Core Approach: 1️⃣ append(val) Store a transformed value: val' = (val - add) / mul (handle modulo carefully) 2️⃣ addAll(inc) Just update: add += inc 3️⃣ multAll(m) Update both: mul *= m add *= m 4️⃣ getIndex(idx) Return: val * mul + add (mod 10⁹ + 7) 👉 This avoids updating the entire array repeatedly 🚀 🔥 What I Learned Today: Lazy updates can turn O(n) → O(1) Math transformations are powerful in design problems Think in terms of global effect instead of local updates 📈 Challenge Progress: Day 15/100 ✅ Halfway to 30! LeetCode, Design Problem, Math Optimization, Lazy Updates, Modular Arithmetic, Data Structures, DSA Practice, Coding Challenge, Problem Solving #100DaysOfCode #LeetCode #DSA #CodingChallenge #DesignProblem #Math #Optimization #ProblemSolving #TechJourney #ProgrammerLife #SoftwareDeveloper #CodingLife #LearnToCode #Developers #Consistency #GrowthMindset #InterviewPrep

🚀 Day 12 of 100 Days LeetCode Challenge Problem: Maximize Spanning Tree Stability with Upgrades Today’s problem was a high-level graph + greedy + binary search combo 🔥 definitely a step toward interview-level thinking. 💡 Key Insight: We are asked to maximize the minimum edge strength in a spanning tree → this is a classic “maximize the minimum” problem. 👉 That signals: Use Binary Search on Answer 🔍 Core Approach: 1️⃣ Handle Must Edges First All edges with must = 1 must be included Use Union-Find (Disjoint Set) to connect them If they form a cycle → ❌ Invalid 2️⃣ Binary Search on Stability Guess a minimum strength X Check if we can build a spanning tree where: Every edge has strength ≥ X We can upgrade at most k edges 3️⃣ Greedy + Union-Find Check Try adding edges: If strength ≥ X → use directly Else if doubling helps → use upgrade Ensure total upgrades ≤ k 🔥 What I Learned Today: “Maximize minimum” → think Binary Search + Greedy Union-Find is essential for spanning tree problems Combining multiple techniques = real DSA mastery 📈 Challenge Progress: Day 12/100 ✅ Entering advanced zone! LeetCode, Graph Theory, Minimum Spanning Tree, Union Find, Binary Search, Greedy Algorithm, Optimization, DSA Practice, Problem Solving #100DaysOfCode #LeetCode #DSA #CodingChallenge #GraphTheory #UnionFind #BinarySearch #GreedyAlgorithm #ProblemSolving #TechJourney #ProgrammerLife #SoftwareDeveloper #CodingLife #LearnToCode #Developers #Consistency #GrowthMindset #InterviewPrep

I just completed 100 problems on LeetCode — but the real value is in how my thinking evolved. When I started, I struggled with basic syntax, debugging errors, and even simple problems felt overwhelming. Instead of rushing through questions, I focused on building a strong foundation step by step. Here’s how my journey progressed: 🔹 Data Structures I worked on: • Arrays • Strings • Linked Lists • Stack • HashMap 🔹 Problem-Solving Patterns I learned : • Brute Force → understanding the problem • Two Pointer technique • Sliding Window (fixed & variable) • Hashing / Frequency Maps • Prefix Sum • Slow & Fast Pointer • Stack-based problems • Monotonic Stack • Greedy Algorithms 🔹 Key Improvements: • Reduced silly mistakes (index errors, edge cases) • Better debugging and cleaner code • Shifted from “what to do” → “why it works” 📊 Stats: • 100 problems solved • 55 Easy | 41 Medium | 4 Hard • 70%+ acceptance rate 💡 Biggest realization: DSA is not about solving more problems — it’s about recognizing patterns and applying them efficiently. 🚀 Next Goals: • Solve more Medium & Hard problems • Improve speed and consistency • Prepare for real coding interviews If you're starting your DSA journey: Don’t focus on speed. Focus on understanding. Speed comes later. #leetcode #dsa #coding #programming #softwareengineering #learning

Hii ✨ 🚀 Day 4 / 150 — Top Interview Questions Journey Solved Remove Duplicates from Sorted Array II on LeetCode today. This problem looked simple… but the logic twist was powerful. 🧩 Problem Summary Given a sorted array, allow each element to appear at most twice. Do it in-place with O(1) extra space and keep the order. 💡 Key Insight (The Trick) The magic line: if k < 2 or nums[i] != nums[k-2]: k < 2 → First two elements can always be kept nums[i] != nums[k-2] → Check if this number is already kept twice This k-2 idea was the real brain exercise today . 🧠 I Learned DSA is not about coding fast It’s about dry run + pattern thinking Understanding why we use k-2 instead of k-1 Two pointers pattern becomes clearer with practice. 📌 Takeaway Struggled a lot to understand the logic… but once it clicked, it felt amazing. Consistency is more important than speed in DSA learning. #Leetcode #DSAPython

🚀 Staying consistent and improving problem-solving skills with each step. LeetCode Progress 15/50 — Missing Number I worked on a problem focused on arrays and mathematical optimization 🧩 💡 The challenge was to find the missing number in a given range from 0 to n using an efficient approach. 🧠 Approach: Applied the sum formula of the first n natural numbers and compared it with the actual sum of the array to identify the missing value. This avoids the need for extra space and keeps the solution efficient. ⏱ Time Complexity: O(n) 💡 What I learned: This problem highlighted how mathematical concepts can simplify problems and lead to clean and optimized solutions. 📈 Strengthening fundamentals and exploring different ways to approach the same problem efficiently. #LeetCode #DSA #ProblemSolving #Cpp #CodingJourney 🚀

Day 93 of #365DaysOfLeetCode Challenge Today’s focus: **Sharpening problem-solving patterns & consistency** Not every day is about solving the hardest problem — some days are about **strengthening fundamentals and recognizing patterns faster**. 💡 **What I focused on today:** * Revisiting previously solved problems * Improving solution efficiency * Understanding *why* an approach works, not just *how* * Practicing edge cases and optimization thinking 📌 **Key Takeaway:** Growth in DSA isn’t just about solving new problems — it’s about: * Building intuition * Reducing solution time * Writing cleaner and more optimized code ⚡ Small improvements daily → Big results over time **What I learned today:** Consistency compounds. The more problems I revisit and refine, the more natural patterns like sliding window, prefix sums, and math-based grouping become. #LeetCode #DSA #CodingChallenge #ProblemSolving #Consistency #TechJourney

Cracking LeetCode Medium: Maximum Distance Between a Pair of Values 🚀 I recently solved a classic Two-Pointer problem: Maximum Distance Between a Pair of Values. The Problem: Given two non-increasing arrays, find the maximum j - i such that i <= j and nums1[i] <= nums2[j]. The Strategy: Two Pointers 💡 Since both arrays are already sorted (non-increasing), a nested loop (O(n²)) would be too slow. Instead, I used the Two-Pointer technique: 1️⃣ Start both pointers i and j at 0. 2️⃣ If nums1[i] <= nums2[j], it's a valid pair! Record the distance j - i and move j forward to find an even larger gap. 3️⃣ If nums1[i] > nums2[j], the current nums1[i] is too large. Move i forward to find a smaller value. Complexity: Time: O(n + m) — much faster than the O(n * m) brute force! Space: O(1) — no extra memory used. Efficient algorithms are all about leveraging the properties of the data (like sorting). Happy coding! 💻 #LeetCode #Coding #TwoPointers #Algorithms #DataStructures #TechLearning #Programming #ProblemSolving

Growth in DSA is not just about solving problems, but about having the patience to truly understand complex ones. Day 35/100 — Data Structures & Algorithms Journey Today I took on a challenging problem — Trapping Rain Water. Instead of rushing to solve it, I focused on learning and understanding the logic behind it step by step. This problem is a perfect example of how a single question can involve multiple approaches and deep thinking. Today’s Focus: Understanding how water is trapped between elevations Breaking the problem into left max and right max concepts Exploring different approaches (Brute Force → Prefix Arrays → Two Pointers) Visualizing the problem instead of directly coding Why this matters? Because not every problem is meant to be solved instantly — some are meant to teach deeper thinking and patience. Key Takeaways: Hard problems improve problem-solving mindset Understanding the intuition is more important than memorizing solutions Visualization plays a key role in complex problems Learning multiple approaches strengthens flexibility Today wasn’t about solving fast… It was about understanding deeply. Step by step, getting stronger #Day35 #DSA #LeetCode #ProblemSolving #SoftwareEngineering #CodingJourney #100DaysOfCode #TechLearning #DeveloperJourney #Programming #Python #InterviewPreparation #CodingSkills #ComputerScience #FutureEngineer #TechCareers #SoftwareDeveloper #LearnInPublic #Consistency

Growth in DSA is not just about solving problems, but about learning how to make optimal choices under constraints. Day 32/100 — Data Structures & Algorithms Journey Today’s problem was Reorganize String, and it introduced me to a powerful combination of Greedy + Heap (Priority Queue). This problem challenged me to think beyond simple traversal and focus on selecting the best possible option at each step. Instead of just arranging characters, I focused on maintaining constraints while building the solution. Today’s Focus: - Understanding how Greedy decisions work step by step - Learning how a Max Heap helps in prioritizing elements - Ensuring constraints (no adjacent duplicates) are maintained - Managing previously used elements efficiently Why this matters? Because many real-world and interview problems require choosing the best option dynamically while maintaining conditions. Key Takeaways: Greedy works when local optimal choices lead to global optimal solutions Heaps help in efficiently managing priorities Tracking previous state is crucial in constraint-based problems Not all problems are about traversal — some are about smart selection This problem gave me a strong understanding of how to combine data structures with decision-making strategies. From solving problems to making optimal decisions 🚀 #Day32 #DSA #LeetCode #ProblemSolving #SoftwareEngineering #CodingJourney #100DaysOfCode #TechLearning #DeveloperJourney #Programming #Python #InterviewPreparation #CodingSkills #ComputerScience #FutureEngineer #TechCareers #SoftwareDeveloper #LearnInPublic #Consistency

🚀 Day 10 of My LeetCode Journey Not all problems are about coding… some are about thinking smarter. Solved: Minimum Operations to Make a Uni-Value Grid ✅ At first glance, it looked like a brute-force problem—but the real trick was hidden in mathematics + optimization 👀 🔹 What I did: • Converted 2D grid → 1D array • Checked feasibility using modulo condition • Used median to minimize total operations (key insight 💡) 🔹 Why median? Because it minimizes the sum of absolute differences—making the solution optimal. 🧠 Biggest Learning: Sometimes the best solution isn’t about trying all possibilities, but about understanding the math behind the problem. 📊 Stats: ⚡ Runtime: 9 ms (Beats 92.59%) 💾 Memory: 90.13 MB From brute force thinking → optimized mindset 🚀 #LeetCode #DSA #ProblemSolving #Optimization #CodingJourney #Consistency