Solving the Pivot Integer Problem on LeetCode

🗓 Day 10 / 100 – #100DaysOfLeetCode 📌 Problem 3228: Maximum Number of Operations to Move Ones to the End The task was to determine the maximum number of operations needed to move all '1's in a binary string to the end, given specific operation rules. 🧠 My Approach: Traversed the string while keeping track of the total count of '1's seen so far. Whenever a '10' pattern appeared, added the current count of '1's to the total operations. This ensured that each move was counted optimally without unnecessary shifts or recomputation. ⏱ Time Complexity: O(n) 💾 Space Complexity: O(1) 💡 Key Learning: This problem reinforced the value of pattern-based logic and prefix counting — powerful techniques for problems involving strings or sequences. It also highlighted how thinking in terms of transitions (1→0) can simplify seemingly tricky problems. Ten days down, ninety to go 🚀 #100DaysOfLeetCode #LeetCodeChallenge #Python #ProblemSolving #Strings #LogicBuilding #DataStructures #Algorithms #DSA #CodingJourney #CompetitiveProgramming #SoftwareEngineering #LearningInPublic #DeveloperJourney #TechStudent #CodingCommunity #CareerGrowth #CodeEveryday #Optimization #KeepLearning #Programming

🧠 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

🗓 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 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 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

🗓 Day 5 / 100 – #100DaysOfLeetCode 📌 Problem 2006: Count Number of Pairs With Absolute Difference K The task was to count the number of pairs (i, j) in an array such that the absolute difference between the two elements equals k. 🧠 My Approach: Used a hash map (Counter) to store the frequency of each element. For every number, checked how many times num + k (or equivalently num - k) appears. Accumulated the count efficiently without double-counting pairs. ⏱ Time Complexity: O(n) 💾 Space Complexity: O(n) 💡 Key Learning: This problem helped strengthen my grasp of hash maps and frequency-based counting — a powerful pattern that simplifies many pair-count and difference problems. Every problem adds clarity and confidence — one step closer to mastery 🚀 #100DaysOfLeetCode #LeetCodeChallenge #Python #ProblemSolving #HashMap #DataStructures #Algorithms #DSA #CodingJourney #CodingChallenge #CodeEveryday #CompetitiveProgramming #SoftwareEngineering #LearningInPublic #DeveloperJourney #TechStudent #CodingCommunity #CareerGrowth #KeepLearning #Programmer #LogicBuilding #TechCareer

Today’s task was about applying conditional statements in Python to check loan eligibility based on income and credit score. Here’s the simple program I wrote 👇 def loan_eligiblity(income, creditscore): if income > 50000 and creditscore > 750: print('He is eligible for a loan') else: print('He is not eligible for a loan') loan_eligiblity(50000, 750) 🧠 What I learned: How to use if-else statements in Python How logical operators like and work The importance of testing boundary conditions (e.g., >= vs >) Every small step counts in becoming better at coding 🚀 #Python #CodingJourney #100DaysOfCode #LearningEveryday #PythonBeginner#Battula Venkata Narayana #1000coders

The __del__( ) method is called a destructor. It perform clean up actions when the object is destroyed. ```python class A:   def __init__(self,s):       self.x=s   def __del__(self):          print("inside destructor")   def f2(self):     self.a=self.x+10     print("a=",self.a) obj=A(100) obj.f2( ) ``` #Output: inside destructor a= 110 #Python #OOPs #Programming #Learning #Coding

🗓 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