LeetCode Challenge Day 90: Number Complement Solution

✅ Day 92 of 100 Days LeetCode Challenge Problem: 🔹 #2011 – Final Value of Variable After Performing Operations 🔗 https://lnkd.in/gX-JQNUJ Learning Journey: 🔹 Today’s problem was about evaluating a sequence of increment and decrement operations. 🔹 I initialized a variable ans = 0 to track the value. 🔹 Used a hashmap to map each operation to its effect: • "++X" and "X++" → +1 • "--X" and "X--" → -1 🔹 Iterated through the operations and updated ans accordingly. 🔹 Returned the final computed value. Concepts Used: 🔹 HashMap / Dictionary 🔹 String Matching 🔹 Simple Simulation Key Insight: 🔹 Instead of using multiple condition checks, mapping operations to values simplifies logic and improves readability. Complexity: 🔹 Time: O(n) 🔹 Space: O(1) #LeetCode #Algorithms #DataStructures #CodingInterview #100DaysOfCode #Python #ProblemSolving #LearningInPublic #TechCareers

✅ Day 95 of 100 Days LeetCode Challenge Problem: 🔹 #869 – Reordered Power of 2 🔗 https://lnkd.in/gkNXaSFM Learning Journey: 🔹 Today’s problem focused on checking whether the digits of a number can be rearranged to form a power of 2. 🔹 I created a helper function to extract and store the digits of a number. 🔹 Then I sorted the digits of the input number for comparison. 🔹 Next, I generated powers of 2 iteratively and compared their sorted digit lists with the input. 🔹 If any match was found, I returned True. Otherwise, continued until the digit length exceeded the input. Concepts Used: 🔹 Digit Extraction 🔹 Sorting 🔹 Simulation of Powers of 2 🔹 Brute Force Optimization Key Insight: 🔹 Instead of generating permutations (which is expensive), sorting digits allows quick comparison. 🔹 Any valid rearrangement must have the same digit frequency as some power of 2. Complexity: 🔹 Time: O(log n * d log d) 🔹 Space: O(d) #LeetCode #Algorithms #DataStructures #CodingInterview #100DaysOfCode #Python #ProblemSolving #LearningInPublic #TechCareers

Day 10 of #100DaysOfCode – Exploring Tuples & Generators 🧠💻 Today’s learning was all about understanding how Python handles data efficiently and intelligently From immutable data structures to memory-efficient iterations — it was a powerful session 🔥 ✨ What I explored today (Programs 116–130): 🔹 Tuple fundamentals ✔️ Creating tuples (with & without parentheses) ✔️ Tuple packing & unpacking ✔️ Accessing & slicing elements 🔹 Tuple operations ✔️ Concatenation & repetition ✔️ Finding min, max, count & index ✔️ Iterating through tuples 🔹 Advanced concepts ✔️ Generator expressions ✔️ Memory-efficient looping ✔️ Generating values on the fly 💡 Key Learning: 👉 Tuples are immutable, which makes them faster and reliable 👉 Generators help in saving memory by producing values when needed Today helped me realize: It’s not just about storing data… It’s about how efficiently we handle it 🔥 Slowly moving from basic coding → writing smarter Python code 🙏 Special thanks to Global Quest Technologies (GQT) for continuous guidance and support throughout this journey 💬 Learning something new every day is becoming a habit now Global Quest Technologies ✨ #100DaysOfCode #Day10 #Python #PythonProgramming #CodingJourney #LearnPython #DataStructures #Tuples #Generators #ProblemSolving #DeveloperMindset #TechSkills #SoftwareDevelopment #Consistency #GlobalQuestTechnologies #GQT

✅ Day 97 of 100 Days LeetCode Challenge Problem: 🔹 #1281 – Subtract the Product and Sum of Digits of an Integer 🔗 https://lnkd.in/gxTAZc6U Learning Journey: 🔹 Today’s problem involved extracting digits of a number and performing two operations simultaneously. 🔹 I initialized two variables: one for product (pr) and one for sum (sm). 🔹 Using a while loop, I extracted each digit using n % 10. 🔹 Updated the product by multiplying the digit and updated the sum by adding it. 🔹 Reduced the number using integer division (n //= 10) after each step. 🔹 Finally returned the difference between product and sum. Concepts Used: 🔹 Digit Extraction 🔹 While Loop 🔹 Arithmetic Operations 🔹 Number Manipulation Key Insight: 🔹 Both product and sum can be computed in a single traversal of digits. 🔹 Efficient use of modulus and division avoids converting the number to a string. Complexity: 🔹 Time: O(d) 🔹 Space: O(1) #LeetCode #Algorithms #DataStructures #CodingInterview #100DaysOfCode #Python #ProblemSolving #LearningInPublic #TechCareers

Code that writes code. 🌌 There is a point in every developer's journey where you stop thinking about Logic and start thinking about Patterns. Advanced Python is about: ~Abstraction: Using Protocols and Generics for structural typing. ~Automation: Using advanced Decorators to inject behavior across entire systems. ~Reliability: Understanding the memory manager so you can prevent leaks before they start. We use these "hidden" features not to make the code more complex, but to make the usage of our code more simple for everyone else. Which part of the "Advanced Mindset" was the hardest for you to learn? For me, it was finally mastering asyncio flow control. #CleanCode #Pythonic #ProgrammingPrinciples #SystemDesign #AdvancedCoding

🚀 Just solved the “Valid Number” problem on LeetCode! This problem looks simple at first glance—but handling edge cases like decimals, signs, and exponents makes it a great test of attention to detail and logical thinking. ✅ Key takeaways: Careful handling of edge cases is crucial Validating input step-by-step can simplify complex parsing problems Writing clean, readable logic beats overcomplicated solutions 💡 Performance: ⚡ Runtime: 3 ms 🧠 Efficient space usage ✅ All test cases passed Problems like this remind me that consistency in practice is what builds strong problem-solving skills. On to the next one! 🔥 #LeetCode #Coding #Python #ProblemSolving #SoftwareEngineering #AIEngineerJourney link of #Solution :- https://lnkd.in/ga9b5pVb

🚀 Day 83 of #100DaysOfCode 📌 Problem Solved: Letter Combinations of a Phone Number (LeetCode 17) Today’s challenge was all about exploring backtracking and how recursive decision-making builds combinations efficiently. 🔍 Given a string of digits (2–9), the goal is to generate all possible letter combinations based on the classic phone keypad mapping. 💡 Key Learning: Instead of trying every possible string blindly, backtracking helps us build combinations step-by-step and explore only valid paths — making the solution clean and efficient. ⚡ Highlights: ✔️ Used recursion to explore all possibilities ✔️ Implemented a digit-to-letter mapping ✔️ Built combinations incrementally ✔️ Achieved optimal runtime performance 📈 Result: ✅ All test cases passed ⚡ 0 ms runtime (Beats 100%) Consistency is starting to compound — one problem at a time. 💪 #LeetCode #DSA #Python #CodingJourney #Backtracking #100DaysOfCode

✅ Day 98 of 100 Days LeetCode Challenge Problem: 🔹 #338 – Counting Bits 🔗 https://lnkd.in/gXdNxX66 Learning Journey: 🔹 Today’s problem focused on counting the number of 1s in the binary representation of numbers from 0 to n. 🔹 I initialized an array ans of size n+1. 🔹 For each number i, I converted it to binary using bin(i)[2:]. 🔹 Counted the number of '1' bits by iterating through the binary string. 🔹 Stored the count in ans[i] and returned the final array. Concepts Used: 🔹 Bit Manipulation (Binary Representation) 🔹 Array Traversal 🔹 String Processing 🔹 Brute Force Approach Key Insight: 🔹 Each number’s bit count can be computed independently. 🔹 Converting to binary and counting '1' works, but can be optimized further using DP or bit tricks. Complexity: 🔹 Time: O(n log n) (binary conversion for each number) 🔹 Space: O(n) #LeetCode #Algorithms #DataStructures #100DaysOfCode #Python #CodingJourney #ProblemSolving #LearningInPublic

🚀 𝐃𝐚𝐲 25/60 – 60-𝐃𝐚𝐲 𝐏𝐲𝐭𝐡𝐨𝐧 𝐂𝐡𝐚𝐥𝐥𝐞𝐧𝐠𝐞 🦾 Today's topic is "𝐀𝐝𝐯𝐚𝐧𝐜𝐞𝐝 𝐞𝐱𝐜𝐞𝐩𝐭𝐢𝐨𝐧 𝐡𝐚𝐧𝐝𝐥𝐢𝐧𝐠" Advanced exception handling in Python goes beyond basic 𝒕𝒓𝒚/𝒆𝒙𝒄𝒆𝒑𝒕 by using targeted 𝒆𝒙𝒄𝒆𝒑𝒕 clauses for specific exception types, enabling clearer control flow and safer error recovery. Using 𝒆𝒍𝒔𝒆 allows you to run success-path logic only when no exception occurs, while `finally ` ensures that critical cleanup (such as closing files or releasing resources) happens regardless of whether an error occurred. This approach improves maintainability, debuggability, and reliability in production-grade code. 𝐄𝐱𝐚𝐦𝐩𝐥𝐞: 𝘥𝘦𝘧 𝘤𝘰𝘯𝘷𝘦𝘳𝘵_𝘥𝘪𝘷𝘪𝘥𝘦(𝘵𝘦𝘹𝘵, 𝘥𝘪𝘷𝘪𝘴𝘰𝘳):   𝘧𝘪𝘭𝘦 = 𝘰𝘱𝘦𝘯("𝘭𝘰𝘨.𝘵𝘹𝘵", "𝘢")      # resource to clean up   𝘵𝘳𝘺:     𝘯𝘶𝘮𝘣𝘦𝘳 = 𝘪𝘯𝘵(𝘵𝘦𝘹𝘵)      # may raise ValueError     r𝘦𝘴𝘶𝘭𝘵 = 𝘯𝘶𝘮𝘣𝘦𝘳 / 𝘥𝘪𝘷𝘪𝘴𝘰𝘳   # may raise ZeroDivisionError   𝘦𝘹𝘤𝘦𝘱𝘵 𝘝𝘢𝘭𝘶𝘦𝘌𝘳𝘳𝘰𝘳 𝘢𝘴 𝘦𝘹𝘤:     𝘧𝘪𝘭𝘦.𝘸𝘳𝘪𝘵𝘦(𝘧"𝘐𝘯𝘷𝘢𝘭𝘪𝘥 𝘪𝘯𝘵𝘦𝘨𝘦𝘳 𝘪𝘯𝘱𝘶𝘵: {𝘦𝘹𝘤}\𝘯")     𝘳𝘦𝘵𝘶𝘳𝘯 𝘕𝘰𝘯𝘦   𝘦𝘹𝘤𝘦𝘱𝘵 𝘡𝘦𝘳𝘰𝘋𝘪𝘷𝘪𝘴𝘪𝘰𝘯𝘌𝘳𝘳𝘰𝘳 𝘢𝘴 𝘦𝘹𝘤:     𝘧𝘪𝘭𝘦.𝘸𝘳𝘪𝘵𝘦(𝘧"𝘊𝘢𝘯𝘯𝘰𝘵 𝘥𝘪𝘷𝘪𝘥𝘦 𝘣𝘺 𝘻𝘦𝘳𝘰: {𝘦𝘹𝘤}\𝘯")     𝘳𝘦𝘵𝘶𝘳𝘯 𝘕𝘰𝘯𝘦   𝘦𝘭𝘴𝘦:     𝘧𝘪𝘭𝘦.𝘸𝘳𝘪𝘵𝘦(𝘧"𝘚𝘶𝘤𝘤𝘦𝘴𝘴: {𝘵𝘦𝘹𝘵} / {𝘥𝘪𝘷𝘪𝘴𝘰𝘳} = {𝘳𝘦𝘴𝘶𝘭𝘵}\𝘯")     𝘳𝘦𝘵𝘶𝘳𝘯 𝘳𝘦𝘴𝘶𝘭𝘵   𝘧𝘪𝘯𝘢𝘭𝘭𝘺:     𝘧𝘪𝘭𝘦.𝘤𝘭𝘰𝘴𝘦()            # always runs Understanding these operators made me realize how programs make decisions and perform actions based on logic. They may look like simple symbols, but they are essential for writing meaningful code. Step by step, building stronger logic. 😆 #learning #python #consistency #challenge #60days #coding #programming #methods #exception #handling #advance

I’ve spent the last few weeks moving beyond just analyzing data to actually building the systems that create it. It’s been a massive learning curve, but I’ve finally started to wrap my head around:   𝗠𝗼𝗱𝗲𝗹𝘀 & 𝗔𝗱𝗺𝗶𝗻: How the database actually structured.   𝗩𝗶𝗲𝘄𝘀 & 𝗧𝗲𝗺𝗽𝗹𝗮𝘁𝗲𝘀: Passing variables between the backend and the UI.   𝗣𝗲𝗿𝗺𝗶𝘀𝘀𝗶𝗼𝗻𝘀: Managing users and groups.   𝗕𝗼𝗼𝘁𝘀𝘁𝗿𝗮𝗽: Keeping things clean and responsive. Huge shoutout to my mentor Rathan Kumar for the guidance. Check out the live site - https://lnkd.in/g-jkXR5x On to the next build! #Django #Python #DataEngineering #Learning #FullStack