Dilip Kumar’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 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

🚀#3217: Delete Nodes from Linked List present in an Array Recently, I explored an interesting problem involving the removal of specific nodes from a linked list based on a given list of values. 💡 Problem Overview: Given a linked list and a list of numbers nums, the task is to delete all nodes whose values are present in nums. 🔍 Approach Summary: 1️⃣ Convert nums into a set for constant time lookups. 2️⃣ Traverse the linked list using two pointers, curr (current node) and prev (previous node). 3️⃣ If the current node’s value is in the set: - If it’s the head, move the head forward. - Otherwise, link the previous node to the next node, effectively removing the current one. 4️⃣ Continue traversing until all matching nodes are removed. ✨ Key Learnings: - Utilizing a set improves efficiency for value lookups. - Careful handling of the head node prevents pointer issues. - Clean traversal logic leads to better readability and fewer edge case errors. #Python #DataStructures #LinkedList #Coding #ProblemSolving #LeetCode #DSA #LearningJourney

⚡ Day 91 of #100DaysOfDSA – Contains Duplicate II 🔄 📌 Problem. no 219: Determine whether there exist two identical elements in an array such that their indices are within distance k. If such elements exist — return True; otherwise, return False. 🚀 Runtime: 23 ms – Beats ⚡97.32% of Python submissions 💾 Memory: 23.88 MB – Beats 87.29% 💻 Language: Python ✅ Result: Accepted – 65 out of 65 test cases passed successfully This challenge deepened my understanding of hash map optimization and index-based checks for nearby duplicates — a perfect blend of logic and efficiency. 🔑 Key Learnings ✔️ Used a dictionary to store indices for O(n) efficiency ✔️ Applied index difference checks with constant-time lookups ✔️ Strengthened reasoning on spatial constraints in arrays 🎯 Day 91 — Smart hashing, clean logic, and another step forward in mastering efficient Python solutions. 🚀 #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

📌 Problem. no 179: Given a list of non-negative integers, arrange them such that they form the largest possible number. Solved using a custom comparator to sort numbers based on concatenation order and achieve the optimal result. ⚡ Runtime: 3 ms – Beats 78.56% of submissions 💾 Memory: 12.69 MB – Beats 24.66% of solutions 💻 Language Used: Python ✅ Status: Accepted – All 235 test cases passed successfully! This problem enhanced my understanding of string-based comparison, custom sorting, and optimization through logic-based ordering. It’s an elegant challenge that blends sorting and string manipulation seamlessly. 🔑 Key Learnings: ✔️ Learned how to design and implement custom comparators ✔️ Understood how concatenation order affects numeric outcomes ✔️ Strengthened my grasp on sorting logic and greedy approaches 🎯 Day 84 — A creative challenge that refined my problem-solving through custom sorting and logical structuring! 🚀🔥 #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

🔥 Day 99 of #100DaysOfDSA – Intersection of Two Arrays 🔢 📘 Problem. no 349: Given two integer arrays, find their intersection. Each element in the result must be unique, and the order does not matter. This problem reinforces the importance of understanding set operations and efficient data manipulation in Python. It’s simple, clean, and elegant — exactly what makes coding satisfying! ⚡ 🚀 Runtime: 0 ms – Beats ⚡100.00% of Python submissions 💾 Memory: 12.53 MB – Beats 57.86% 💻 Language: Python ✅ Result: Accepted – 57 / 57 test cases passed flawlessly! 🟢 🔑 Key Takeaways ✔️ Using set intersection dramatically simplifies the code 🧠 ✔️ Focus on clarity and simplicity — minimalism can be powerful 💡 ✔️ Always aim for readable and efficient solutions over complex ones 💬 This challenge highlighted how fundamental data structures can lead to optimal solutions. As I near the finish line of my #100DaysOfDSA journey, the consistency and daily problem-solving truly pay off! 🌟 Day 99 — Precision through simplicity. One day left to go! 🚀🔥 #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