Debugging in Reality vs Theory

💡 A Small Reality in Tech Expectation: “I’ll finish this task quickly.” Reality: Spending most of the time figuring out why something isn’t working 😅 Expectation: “Code is done.” Reality: Debugging just started. One thing I’ve realized is that a lot of learning in technology comes from debugging and figuring things out step by step. And that’s what actually makes us better. #TechLife #SoftwareEngineering #LearningJourney

Error 404 : Understanding Not Found Tried to figure out life... but the logic isn't compiling😅 Still debugging, still learning, still pressing "run" everyday. #techlife #learning #tech #IT

Been thinking about that “can’t guarantee correctness” thing again. One part I didn’t expect is how weird debugging has become. In most systems, if something goes wrong, you can trace it. There’s usually a point where the logic breaks. Here, not really. Sometimes it’s not even obviously wrong, it just takes a path that doesn’t end well, and when you look at it step by step, each decision kind of makes sense. Which is what makes it frustrating, because you’re not fixing broken logic anymore, you’re trying to understand why the system thought this was a good idea in the first place. And that kind of bleeds into evaluation too. You’re not always checking “is this correct?”, it’s more like “is this… acceptable?” And I’m still not sure what “acceptable” even means here half the time. Anyway yeah, this feels very different from normal debugging. #AIEngineering #AIisWierd #ButItsAlsoPrettySick

You build something. It works. Perfectly. On your machine. Then you deploy. It breaks. You say: “It worked before.” This happens a lot. Because your system is not the same as production. Different: Environment Data Versions Settings Small differences. Big problems. That’s why teams use: Same configs Testing Containers To reduce surprises. Simple idea. Same code. Different setup. Different result. Quick question: Have you ever said “it works on my machine”? #SoftwareDevelopment #Programming #Technology

Debugging something in tech is a full emotional journey. You start with: “This should be a quick fix.” 10 minutes later: “Why isn’t this working?” Then: “Okay… what did I even do wrong?” At some point: you question your code, your logic… your entire existence. So you restart everything. Maybe change one tiny thing. Maybe nothing. And suddenly… It works. #DeveloperLife #CodingLife #TechLife #ProgrammerHumor #SoftwareDevelopment

🚀 Day 16 of DSA — Pattern-wise Practice Today I tackled a classic Sliding Window problem: 🔹 Longest Subarray with Ones After Replacement Under the amazing guidance of @Pratyush Bhaiya, I'm following a structured, pattern-wise approach — and it's making all the difference! 💡 ───────────────────────────── 🧩 Problem: Given a binary array and an integer k, find the length of the longest subarray containing only 1s — after replacing at most k zeros with ones. ───────────────────────────── 💡 Approach (Sliding Window): 1️⃣ Use two pointers — left and right — to maintain a window. 2️⃣ Expand the window by moving right and keep a count of zeros inside the window. 3️⃣ If zeros > k, shrink the window from the left until zeros ≤ k. 4️⃣ At each step, track the maximum window size → that's your answer! ⏱ Time Complexity: O(n) — single pass 📦 Space Complexity: O(1) — no extra space ───────────────────────────── 🔑 Key Insight: The window always holds at most k zeros. The trick is — instead of counting 1s, we count zeros and control the window based on that! ───────────────────────────── The pattern-wise approach is 🔥. Once you understand the template, similar problems become much easier to solve! Grateful for the structured learning under Pratyush Narain Bhaiya 🙌 Keep solving, keep growing! 💪 #DSA #SlidingWindow #CodingJourney #Day16 #LeetCode #100DaysOfCode #DataStructures #Algorithms #CompetitiveProgramming

The hardest bugs 🪲 aren’t in the code. They’re in how we think about the problem. Sometimes we rush to fix things, add more logic, try another tool, when the real solution is stepping back and asking, “Am I even solving the right problem?” Slowing down, simplifying, and rethinking has saved me more time than any framework ever could. Still unlearning. Still improving! #SoftwareEngineering #ProblemSolving #DeveloperMindset #TechLife #CodingJourney #ContinuousLearning

🚀 Day 17 of 100 Days LeetCode Challenge Problem: Largest Submatrix With Rearrangements Today’s problem is a powerful mix of matrix + greedy + sorting optimization 🔥 💡 Key Insight: We are allowed to rearrange columns, which changes everything! 👉 Instead of fixed positions: Focus on heights of consecutive 1’s in each column 🔍 Core Approach: 1️⃣ Build Heights Matrix For each cell: If 1 → increase height from previous row If 0 → reset to 0 👉 This converts the problem into a histogram per row 2️⃣ Sort Each Row (Greedy Move) Sort heights in descending order Why? → To maximize width for larger heights 3️⃣ Calculate Max Area For each position j: Area = height[j] × (j + 1) Track maximum across all rows 🔥 What I Learned Today: Rearrangement problems → think flexibility optimization Converting matrix → histogram simplifies logic Sorting can unlock hidden maximums 📈 Challenge Progress: Day 17/100 ✅ Strong consistency streak! LeetCode, Matrix, Greedy Algorithm, Sorting, Histogram, Optimization, DSA Practice, Coding Challenge, Problem Solving #100DaysOfCode #LeetCode #DSA #CodingChallenge #Matrix #GreedyAlgorithm #Sorting #ProblemSolving #TechJourney #ProgrammerLife #SoftwareDeveloper #CodingLife #LearnToCode #Developers #Consistency #GrowthMindset #InterviewPrep

🚀 Day 22 of 100 Days LeetCode Challenge Problem: Determine Whether Matrix Can Be Obtained By Rotation Day 22 is a classic matrix rotation + simulation problem 🔥 💡 Key Insight: We can rotate the matrix in 90° steps (up to 4 times): 90° 180° 270° 360° (back to original) 👉 If at any step mat == target → ✅ True 🔍 Core Approach: 1️⃣ Rotate Matrix (90° Clockwise) Transpose the matrix Reverse each row 👉 This gives one 90° rotation 2️⃣ Repeat Rotation 4 Times After each rotation: Compare with target 👉 If match found → return true 👉 Else after 4 rotations → false 💡 Optimization: Early exit when match is found Avoid unnecessary rotations 🔥 What I Learned Today: Matrix rotation is a standard pattern Simulation problems require step-by-step accuracy Reusing logic reduces complexity 📈 Challenge Progress: Day 22/100 ✅ Staying consistent & sharp! LeetCode, Matrix, Rotation, Simulation, Arrays, DSA Practice, Coding Challenge, Problem Solving #100DaysOfCode #LeetCode #DSA #CodingChallenge #Matrix #Rotation #Simulation #ProblemSolving #TechJourney #ProgrammerLife #SoftwareDeveloper #CodingLife #LearnToCode #Developers #Consistency #GrowthMindset #InterviewPrep

🚀 Solving Queue Simulation Smartly (LeetCode – Count Students Unable to Eat Lunch) In this problem, I implemented an optimized approach instead of brute-force simulation. 🔹 First, I counted students based on their sandwich preference (0 and 1). 🔹 Then, I simulated the queue: 1.If the front student matches the sandwich → both are removed 2.Otherwise, the student moves to the back 🔹 Key Insight: If no student prefers the current sandwich type, we can stop early — no need to continue unnecessary rotations. ✅ This reduces redundant operations and makes the solution more efficient. 💡 Takeaway: Sometimes counting + simulation together can simplify problems and avoid infinite loops or TLE. #LeetCode #ProblemSolving #DataStructures #Queue #CompetitiveProgramming #CodingJourney