Anjali Joshi’s Post

🔥 Day 97 of #100DaysOfDSA – Counting Bits 💡 📌 Problem. no 338: For every number from 0 to n, count the number of 1s in its binary representation and return the list of counts. An elegant way to connect bit manipulation with loop optimization! ⚙️ 🚀 Runtime: 15 ms – Beats ⚡46.30% of Python submissions 💾 Memory: 17.81 MB – Beats 48.48% 💻 Language: Python ✅ Result: Accepted – 15 / 15 test cases passed 🎯 🔑 Key Learnings ✔️ Binary representation is a powerful yet simple way to analyze integer patterns ✔️ Python’s built-in functions like bin() and .count() simplify complex operations ✔️ Clean loops and logic always make debugging easier 💡 Day 97 — Simplicity in Bits, Power in Logic! 🔢 #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 94 of #100DaysOfDSA – First Bad Version 🧩 📌 Problem. no 278: Find the first bad version in a sequence of software versions using minimal API calls. 🚀 Runtime: 11 ms – Beats ⚡86.79% of Python submissions 💾 Memory: 12.47 MB – Beats 49.90% 💻 Language: Python ✅ Result: Accepted – 24 / 24 test cases passed successfully This challenge was a neat application of binary search to minimize API queries and optimize decision-making over large datasets. 🔑 Key Learnings ✔️ Efficient mid-point calculation prevents overflow in large searches ✔️ Binary search is a timeless and versatile tool ✔️ Understanding search space optimization enhances overall coding logic 🎯 Day 94 — Debug less, think binary, and aim for precision! ⚙️📈 #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 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 69 of #100DaysOfCode Solved LeetCode Problem #3542: Minimum Operations to Convert All Elements to Zero (Medium) Concepts Used: Stack Data Structure Efficient traversal and state management Understanding subarray operations Approach Summary: Iterated through each element while maintaining a stack to track increasing sequences. Incremented operation count whenever a new minimum appeared. This approach ensures minimum operations to reduce all elements to zero efficiently. Result: Accepted (Beats 85.71% in Runtime & 90.06% in Memory) Each day, one problem closer to mastery! #Python #LeetCode #100DaysOfCode #ProblemSolving #DataStructures #Algorithms #CodingJourney #MCA

🔥 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 45 of #100DaysOfDSA — Reverse Linked List Problem: Reverse Linked List (LeetCode #206) Given the head of a singly linked list, reverse it and return the reversed list. Concepts Used: 🧠 Stack-based approach Traverse the linked list and push each node’s value into a stack. Then reassign values by popping from the stack to reverse the list. 🧩 Learning Reflection: This problem helped me understand how stacks can simplify linked list manipulations. Though not the most space-efficient solution, it reinforces the concept of LIFO (Last In, First Out) operations beautifully. ⏱️ Complexity: Time: O(N) Space: O(N) 💬 Closing Thought: Sometimes, using an extra data structure makes logic clearer — and that’s okay while learning. #LeetCode #DSA #LinkedList #Python #100DaysOfCode #CodingJourney

⚡ Day 92 of #100DaysOfDSA – Single Number III 🔍 📌 Problem. no 260: Given an array where every element appears twice except for two unique numbers, find both unique elements that appear only once. 🚀 Runtime: 0 ms – Beats ⚡100.00% of Python submissions 💾 Memory: 13.23 MB – Beats 65.94% 💻 Language: Python ✅ Result: Accepted – 35 / 35 test cases passed flawlessly This problem pushed me to dive deeper into bit manipulation and understand how XOR can efficiently isolate unique numbers without using extra space. 🔑 Key Learnings ✔️ XOR helps cancel out repeating elements effectively ✔️ Smart bit-level logic simplifies complex comparisons ✔️ Achieved O(n) time and O(1) space – clean and optimal 🎯 Day 92 — Every bit counts when it comes to optimization! ⚙️🔥 #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

#Day254 of Solving #DSA ✅ LeetCode Daily Progress Today I solved Question 240 – Search a 2D Matrix II 💻 This problem was quite interesting as it required optimizing search within a sorted 2D matrix. Instead of checking every element, I used a binary search–like logic — starting from the top-right corner, and moving left if the current element was greater than the target or down if it was smaller. This approach reduced the complexity to O(m + n), making it much more efficient than a brute-force search. ⚡ 🧠 Key takeaway: Smart traversal techniques can often replace heavy loops — understanding patterns in data helps you find optimal paths! #LeetCode #Coding #DSA #BinarySearch #ProblemSolving #Python #CodingJourney

Day:79/100 Recursion of Palindrome section ✅️ #100daysofcodingchallenge Recursion: ✔️Function calls itself: A function invokes itself repeatedly until a base case is reached. ✔️Base case: A condition that stops the recursion. ✔️Recursive case: The function calls itself with a smaller input or a modified version of the original input. ✔️Stack overflow: A potential risk if recursion is too deep. ✔️Memoization: Caching results to avoid redundant calculations. ✔️Tail recursion: A special case where the recursive call is the last operation. ✔️Base case: Empty or single-character strings are palindromes. ✔️ Recursive case: Compare first and last characters, then recurse on the substring. ✔️Symmetry: Palindromes have symmetry around their center. Benefits: 🔸️ Elegant code: Recursion can make the code more concise and readable. 🔸️ Easy to implement: Recursive palindrome checks can be simple to understand and implement. #Nxtwave #Intensive #100dayscoding #Python #Tech #coding #Programming #TechSkills #CareerDevelopment #DataLiteracy #BusinessIntelligence

🗓 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