How Recursion Works: A Programming Concept

I recently asked Cursor to fix an issue that was stopping our codebase from generating a response. It analyzed the problem... and modified 5 files, writing hundreds of lines of code. That felt odd for what seemed like a simple fix. So I dug into the code myself and guess what? One. Single. Condition. That’s all that was preventing the response from being generated. One tiny if statement. Yet Cursor went on a coding spree. This is exactly why you can't blindly trust LLMs with your code. They're powerful, but they don’t understand context the way we do. If I had blindly accepted those changes, our codebase would've turned into chaos. #coding #GenAI #python #softwareEngineering #CursorAI

🚀Day 71 of #100DaysOfCode Today's challenge was LeetCode Problem #3228 - Maximum Number of Operations to Move Ones to the End. This problem focused on binary string manipulation and calculating the maximum possible operations under specific conditions. It tested the ability to analyze how '1's can be shifted past '0's efficiently while maintaining optimal time complexity. Key Learnings: Applied an efficient linear approach to avoid unnecessary simulations. Learned to track and update the count of '1's dynamically during iteration. Strengthened problem-solving strategies for string-based algorithmic questions. Language Used: Python Runtime: 55 ms (Beats 74.85%) Memory: 18.12 MB (Beats 54.49%) Day 70 represents continuous progress in improving logical reasoning and coding efficiency. Each solved problem builds a stronger foundation for advanced algorithmic thinking and real-world software development. #LeetCode #Python #ProblemSolving #CodingChallenge #100DaysOfCode #Algorithm #DataStructures #Mythyly

💻 Day 61 of #100DaysOfCode — When Brute Force Meets Patience 🐍🧠 Today’s coding adventure: solving the “Little Professor” problem from CS50’s Python course 🎓 What started as a simple arithmetic challenge quickly turned into a full-on debugging saga. 😅 I went full brute force mode ⚔️ — breaking everything down step by step: 🔹 Generated random integers 🔹 Checked sums and conditions 🔹 Split the logic into smaller, testable parts Everything worked great… ✅ All test cases passed — except one. 💀 After a long stare at my terminal (and a few cups of chai ☕), I realized the issue wasn’t logic — it was presentation. My program was outputting the numbers in block-style lists instead of clean, streamlined sequences. Fixed it by generating the numbers one by one ➡️, and just like that — 💥 ALL TESTS PASSED! 🎯 This reminded me once again — 👉 Sometimes, it’s not your code that’s wrong… It’s the tiny overlooked detail that’s making all the noise. Every bug teaches patience. Every fix teaches precision. And every solved problem? That’s pure dopamine. ⚡🐍 #100DaysOfCode #Python #CS50 #Programming #ProblemSolving #Debugging #SoftwareEngineering #LearningInPublic #BuildInPublic #CodeNewbie #TechJourney #DeveloperLife #CleanCode #LogicBuilding #SoftwareDevelopment #DataStructures #Algorithms #CodingChallenge #FullStackDeveloper #AI #DeveloperCommunity #CodingIsFun #CodingMotivation #WebDevelopment #IndiaTech #PythonProjects

I used to manage customer complaints for a logistics project. Some people yelled. Some sent long emails. Most of them just wanted one thing; to be heard. Now when my Python compiler screams at me with red error text, I think, “Alright buddy, I hear you.” 😅 Both situations start the same: → something didn’t go as expected. → frustration builds. → you realize it’s your fault. But here’s the insight: You can’t build anything meaningful in business or code; without things breaking first. The best systems, teams, and humans are refined through feedback. Sometimes that feedback just comes in the form of ValueError: invalid literal for int(). #debugging #python #salestotech #programming #compiler

No need n8n anymore because i Just found this AgnFlow. A new open-source framework that lets you build AI agent workflows visually and it’s all Python. What makes it stand out: • Build flows like you’d draw them — connect nodes, branch logic, add loops • Supports both sync and async execution • Designed for multi-agent systems, supervisor logic, and swarm behaviors • Lightweight, fast, and actually developer-friendly It feels like the first serious attempt to make agent workflow design as intuitive as coding in Python itself. Comment repo - I’ll DM you the link.

🧠 Day 38 / 100 – Recursion: Factorial of a Number (LeetCode-#509) Today’s challenge was all about recursion — one of the most elegant concepts in programming. I revisited the Factorial problem, which beautifully demonstrates how a big problem can be broken into smaller subproblems. The idea is simple: 👉 The factorial of n is n * factorial(n-1) until n becomes 1. But the real challenge lies in understanding the flow of recursive calls and how the call stack unwinds to give the final result. This problem reminded me that recursion isn’t just about repeating a function — it’s about trusting the process and thinking in terms of smaller steps to solve complex problems. 🔍 Key Learnings Every recursive function must have a base case to prevent infinite loops. The call stack stores each recursive call until it’s resolved. Recursion is a natural fit for problems that can be divided into smaller, similar subproblems. 💭 Thought of the Day Recursion teaches patience and structure. Sometimes, you need to trust that solving the smaller version of a problem will help you conquer the big one — both in code and in life 💫. 🔗 Reference Problem:https://lnkd.in/g3yNGDbJ #100DaysOfCode #Day38 #LeetCode #Python #Recursion #Factorial #ProblemSolving #CodingChallenge #Algorithms #ProgrammingMindset #DataStructures #CleanCode #LearnByDoing #TechGrowth #PythonProgramming

✨ Leetcode #3370: Smallest Number With All Set Bits Today, I solved an interesting bit manipulation problem where the task was to find the smallest number greater than or equal to a given n, such that its binary representation contains only set bits (1s). 🔍 Concept Overview: - This problem beautifully highlights the power of bit manipulation and mathematical insight. - The key lies in observing the pattern of numbers that have all bits set, like 1, 3, 7, 15, 31, etc. - These numbers can be represented in a uniform mathematical form, which makes the solution both elegant and efficient. 💡 Key Learning: - Understanding how bit shifting and logarithmic operations can simplify problems involving binary representations. - Reinforcing the importance of pattern recognition in bit level problems. - Appreciating how a constant time solution can emerge from strong mathematical reasoning. 🧠 Complexity: O(1) A pure logic based solution; concise, optimal, and satisfying! #LeetCode #BitManipulation #Coding #ProblemSolving #Python #LearningEveryday #DataStructuresAndAlgorithms

🗓 Day 12 / 100 – #100DaysOfLeetCode 📌Problem 3234: Count the Number of Substrings With Dominant Ones A substring is considered to have dominant ones if: Number of 1s ≥ (Number of 0s)² The challenge was to count how many substrings in the binary string satisfy this condition. 🧠 My Approach: Iterated through substrings while tracking zero count and one count. Used the condition ones ≥ zeros² to determine validity. Applied early stopping when zeros became large, since the condition becomes much harder to meet as zeros grow. This pruning helped avoid unnecessary checks and made the approach more efficient. 💡 Key Learning: This problem highlights how mathematical constraints can simplify substring evaluation. Understanding how zeros grow quadratically in the condition helped shape a smarter, more optimized checking approach rather than brute-force enumeration. A great exercise in reasoning about substring properties and designing early-exit logic. Consistent effort… consistent progress 🚀 #100DaysOfLeetCode #LeetCodeChallenge #Python #ProblemSolving #BinaryStrings #StringAlgorithms #Optimization #LogicBuilding #DataStructures #Algorithms #DSA #CompetitiveProgramming #CodingJourney #SoftwareEngineering #LearningInPublic #TechStudent #DeveloperJourney #CareerGrowth #CodeEveryday #CodingCommunity #KeepLearning #Programmer

Day:83/100 Dictionaries ✅️ #100daysofcodingchallenge Dictionaries: ✔️ Key-value pairs: Dictionaries store data in key-value pairs. ✔️ Mutable: Dictionaries are mutable, meaning they can be modified after creation. ✔️ Defined using curly brackets: Dictionaries are defined using curly brackets `{}`. ✔️ Fast lookups: Dictionaries provide fast lookups, with an average time complexity of O(1). ✔️ Key uniqueness: Dictionary keys must be unique. ✔️ Value flexibility: Dictionary values can be of any data type. Methods: 🔸️.keys(): Returns a view object that displays a list of all keys. 🔸️.values(): Returns a view object that displays a list of all values. 🔸️.items(): Returns a view object that displays a list of all key-value pairs. #Nxtwave #Intensive #100dayscoding #Python #Tech #coding #Programming #TechSkills #CareerDevelopment #DataLiteracy #BusinessIntelligence

Complex problems often have elegant solutions hidden behind intimidating jargon. ✨ Today, I'm sharing a breakdown of the Strategy Design Pattern. 🚀 It's a fundamental tool that empowers you to write cleaner, more flexible code by making algorithms interchangeable. I've put together a user-friendly document that explains the 'what' 🤔, 'how' 🛠️, and 'where' 🗺️ of this pattern, backed by a real-world Python example. 🐍 Whether you're a seasoned pro or just starting out, I believe understanding this pattern will be a significant asset in your development toolkit. 💼 Let's dive in and elevate our coding practices together! 💡 Feel free to share your thoughts and questions below. 👇 #DesignPatterns #PythonDevelopers #StrategyDesignPattern #ContinuousLearning #SoftwareCraftsmanship #LowLevelDesign #HighLevelDesign #LLD #HLD #SoftwareDevelopment #NotificationSystem #WeekendLearning #Sunday #Python #SystemDesign #GenAI #AgenticAI