Solved LeetCode 3542: Minimum Operations to Make Array Non-Decreasing

🗓 Day 11 / 100 – #100DaysOfLeetCode 📌 Problem 2536: Increment Submatrices by One The task was to apply multiple increment operations on submatrices of an n × n grid and return the final updated matrix. 🧠 My Approach: Used a 2D difference matrix to avoid incrementing each cell individually. Updated only the boundaries for each operation to keep the process efficient. Applied a 2D prefix sum after all operations to reconstruct the final matrix. This method is scalable and avoids repetitive nested loops. 💡 Key Learning: This problem emphasized the power of difference arrays and prefix sums — techniques that transform heavy matrix operations into clean, optimized solutions. These patterns are widely used in competitive programming, segment trees, and efficient grid-based algorithms. Every new problem strengthens both technique and intuition 🚀 #100DaysOfLeetCode #LeetCodeChallenge #Python #ProblemSolving #Coding #DataStructures #Algorithms #DSA #Matrix #PrefixSum #DifferenceArray #CompetitiveProgramming #LeetCode #Tech #Programming #SoftwareEngineering #CodeNewbie #DeveloperJourney #TechStudent #CSE #DataScience #CodeEveryday #LearnToCode #CodingCommunity #CareerGrowth #Optimization #LogicBuilding #ComputerScience #StudentsWhoCode #KeepLearning #Programmer #EngineerLife #TechCareer #CodeLife

🗓 Day 14 / 100 – #100DaysOfLeetCode 📌 Problem 1437: Check If All 1’s Are at Least K Places Away The goal was to determine whether every pair of consecutive 1s in the array is separated by at least k zeros. 🧠 My Approach: Traversed the array while tracking the index of the previous 1. On encountering a new 1, checked the distance from the last one. If the gap was smaller than k, the condition failed instantly. This single-pass logic keeps the solution efficient and clean. 💡 Key Learning: This problem reinforced the importance of index tracking and using simple arithmetic comparisons to validate structural constraints. It’s a great reminder that not all problems require heavy algorithms — sometimes, clarity and careful traversal are enough for an optimal solution. Small steps forward build strong reasoning over time 🚀 #100DaysOfLeetCode #LeetCodeChallenge #Python #ProblemSolving #LogicBuilding #Arrays #Algorithms #DataStructures #DSA #CompetitiveProgramming #CodingJourney #SoftwareEngineering #LearningInPublic #DeveloperJourney #TechStudent #CareerGrowth #CodeEveryday #CodingCommunity #KeepLearning #Programming #TechCareer

🚀 Day 4 – LeetCode Problem Solving Journey 💻 Today’s challenge was “Merge Sorted Array” (LeetCode #88) — a classic array manipulation problem that helps improve understanding of two-pointer techniques and in-place merging. Problem: You are given two sorted arrays, nums1 and nums2, and the task is to merge them into a single sorted array, stored inside nums1. Example: Input: nums1 = [1,2,3,0,0,0], m = 3 nums2 = [2,5,6], n = 3 Output: [1,2,2,3,5,6] 🧠 Concept Used: Two-pointer approach starting from the end Comparison and in-place insertion Time Complexity: O(m + n) Space Complexity: O(1) Learning how to handle in-place data modification efficiently is a key step in mastering DSA! #LeetCode #Day4 #ProblemSolving #DSA #CodingJourney #100DaysOfCode #Python #Programming #DevelopersCommunity #SoftwareEngineering #LearningInPublic #CareerGrowth

💻 Problem Solving session – Day 2 Another productive session focused on strengthening problem-solving and logical thinking through Python at 10000 Coders under Battula Venkata Narayana sir. Today’s topics and exercises included: 🔹 Checking if a number is Perfect or not 🔹 Implementing Factorial and Fibonacci using Recursion 🔹 Generating a List of Palindromes 🔹 Checking for a Neon Number 🔹 Printing a List of Neon Numbers within a range Loving how each session builds stronger problem-solving skills step by step! 🚀 #10KCoders #Python #ProblemSolving #Recursion #CodingJourney #LearningByDoing #LogicBuilding #hiring

🚀 Solved a Classic String-Search Problem! I recently worked on the problem “Find the index of the first occurrence of a string in another string” (LeetCode 28 — strStr()), and it was a great exercise in understanding string manipulation and efficient search techniques. 🔍 Problem Summary Given two strings, haystack and needle, the goal is to return the index of the first occurrence of needle within haystack, or -1 if it doesn’t exist. 🔧 My Approach I implemented two solutions: 1️⃣ Basic Sliding Window Approach Iterate through haystack Compare each substring with needle Return the index when a match is found 2️⃣ Optimized Thought Process (KMP-ready) Explored how KMP can reduce time complexity from O(n*m) to O(n) Understood prefix functions and pattern matching fundamentals 🧠 What I Learned Strengthened understanding of string traversal Learned how to optimize search operations Practiced writing clean and readable code Got a deeper understanding of how real search algorithms (like KMP) work behind the scenes Happy to connect with others exploring DSA, algorithms, and problem-solving! 🚀 #️⃣ #dsa #leetcode #coding #programming #python #softwaredevelopment #algorithms #computerscience

When Your Function Decides to Call Itself You ever write a function… and then watch it call itself like it’s trying to have a deep conversation about purpose? That’s recursion. It’s a magical (and slightly chaotic) moment. The first time I understood recursion, I felt like I’d unlocked a cheat code in programming. It’s not just about loops or maths, it’s about trust. You trust your function to handle a smaller version of the same problem without losing its mind halfway. Example: def factorial(n):   if n == 0:     return 1   else:         return n * factorial(n - 1) Recursion taught me patience. Both in code and in life, because sometimes, solving something big just means breaking it into smaller, saner bits and trusting the process to resolve itself. #Programming #Python #Recursion #CSHumor #CodingLife

🗓 Day 3 / 100 – #100DaysOfLeetCode 📌 Problem 1913: Maximum Product Difference Between Two Pairs The goal was to find the maximum product difference between two pairs of numbers in an array — specifically, the difference between the product of the two largest numbers and the product of the two smallest numbers. 🧠 My Approach: Sorted the array to easily identify the smallest and largest elements. Computed the difference between the product of the two largest numbers and the two smallest numbers. Leveraged sorting for clarity and simplicity in implementation. ⏱ Time Complexity: O(n log n) 💾 Space Complexity: O(1) 💡 Key Learning: This problem reinforced the importance of recognizing when sorting simplifies a problem. Instead of using complex loops or comparisons, a single sort operation can lead to a clean and optimal solution. Every day of this challenge is sharpening my ability to think more analytically and code more efficiently ✨ #100DaysOfLeetCode #LeetCodeChallenge #Python #ProblemSolving #DataStructures #Algorithms #DSA #Sorting #CodingJourney #CodeEveryday #LearningInPublic #CompetitiveProgramming #SoftwareEngineering #DeveloperJourney #TechStudent #CareerGrowth #CodingCommunity #KeepLearning

🗓 Day 4 / 100 – #100DaysOfLeetCode 📌 Problem 728: Self Dividing Numbers The task was to find all numbers in a given range that are self-dividing — i.e., numbers that are divisible by each of their digits and contain no zero. 🧠 My Approach: Iterated through the range of numbers. Checked each digit of a number to ensure: It’s non-zero. The original number is divisible by that digit. Collected all numbers that satisfied both conditions. ⏱ Time Complexity: O(n × d) — where d is the number of digits in each number. 💾 Space Complexity: O(1) 💡 Key Learning: This problem strengthened my understanding of digit-wise iteration and conditional logic — simple concepts that are essential for handling number-based and math-intensive problems efficiently. Small problems like these build the habit of writing clean, readable, and logical code — one step closer each day 🚀 #100DaysOfLeetCode #LeetCodeChallenge #Python #ProblemSolving #LogicBuilding #Programming #DataStructures #Algorithms #DSA #CodingJourney #CodingChallenge #CodeEveryday #LearningInPublic #CompetitiveProgramming #DeveloperJourney #TechStudent #CareerGrowth #CodingCommunity #KeepLearning

🔥 Day 96 of #100DaysOfDSA – Power of Three 💡 📌 Problem. no 326: Check if a given number is a power of 3. If it is, return True; otherwise, return False. Simple yet elegant number theory logic at play. 🚀 Runtime: 11 ms – Beats ⚡61.54% of Python submissions 💾 Memory: 12.45 MB – Beats 51.93% 💻 Language: Python ✅ Result: Accepted – 21,040 / 21,040 test cases passed! 🔑 Key Learnings ✔️ Efficient looping and modular arithmetic can reveal hidden mathematical patterns ✔️ Edge cases (like n <= 0) must always be handled carefully ✔️ Clean, readable code performs just as powerfully as optimized code 🎯 Day 96 — Mathematics + Logic = Pure Programming Magic ✨ #100DaysOfCode #100DaysOfDSA #LeetCode #PythonProgramming #DataStructures #AlgorithmPractice #CodeNewbie #DailyCoding #ProblemSolving #TechJourney #WomenWhoCode #CodeLife #CodingChallenge #DSAChallenge #DeveloperLife #PythonDeveloper #LearnToCode #CodingCommunity #CodeEveryday #SoftwareEngineering #KathirCollegeOfEngineering #KathirCollege #BTechLife #AIDS #FutureEngineer #CodingMotivation #ProgrammingSkills