Mahera Khatoon’s Post

🚀 Day 55 of my Problem Solving Journey Solved Remove Spaces today — a simple yet important string manipulation problem. 💡 Key Learning: Sometimes the easiest problems reinforce the strongest fundamentals. Efficient string handling and clean code matter just as much as complex algorithms. Explored multiple approaches — from built-in methods like "replace()" to manual iteration — and understood how each impacts readability and performance. Small steps like these build consistency and sharpen problem-solving skills over time. 💻 #geekstreak60 #npci #GeeksforGeeks #DSA #Python #ProblemSolving #CodingJourney

🗓 7 April 2026 🚀 LeetCode Problem #973 — K Closest Points to Origin Solved this problem using a Heap (Priority Queue) approach in Python. 💡 Approach: - Calculated the distance of each point from origin using: 👉 x² + y² (no need for square root) - Used a max heap (by pushing negative distance) - Maintained heap size = k - If size exceeds k → removed the farthest point ⚡ Time Complexity: O(n log k) ⚡ Space Complexity: O(k) 🔥 This is a great example of optimizing from brute force (sorting O(n log n)) to a more efficient heap-based solution. Consistency update: solving problems daily and improving problem-solving skills step by step. #leetcode #dsa #python #coding #100DaysOfCode #heaps #learning

🚀 LeetCode Progress Update – Problem Solved! ✅ Problem: Remove Trailing Zeros From a String 💡 Approach: Used reverse traversal to find the first non-zero digit and sliced the string accordingly. 🔍 Key Learning: Efficient string manipulation can avoid unnecessary conversions. Traversing from the end helps solve trailing-based problems quickly. 💻 Code Insight: Instead of removing zeros one by one, I identified the breakpoint and sliced the string — making it optimal and clean. ⏱️ Performance: Runtime: 3 ms ⚡ Beat: 66%+ users Memory: 19.23 MB 📈 Consistency is key — one problem closer to mastery! #LeetCode #CodingJourney #Python #ProblemSolving #DSA #100DaysOfCode

Day 1 of my LeetCode journey 🚀 🧩 Problem: Minimum Distance to the Target Element (1848) 💡 Approach: Looped through the array and tracked the minimum absolute difference whenever the target appeared. 📚 What I learned today: • How to iterate through a list efficiently • Using abs() to compute absolute difference • Tracking minimum values during iteration • Initializing variables correctly using infinity • Better understanding of loops and conditional checks in Python 🛠 Language Concepts Used: • for-loop • if condition • abs() function • min() logic / running minimum ⏱ Time Complexity: O(n) 📦 Space Complexity: O(1) 🔗 GitHub: https://lnkd.in/gZ23dWkV #LeetCode #Python #DSA #100DaysOfCode #LearningInPublic

🚀 Day 38 – LeetCode Journey Today’s problem: Gray Code ✔️ Generated sequence using bit manipulation ✔️ Applied formula: "i ^ (i >> 1)" ✔️ Ensured only one bit changes between consecutive numbers 💡 Key Insight: Gray Code is useful in minimizing errors in digital communication, as only one bit changes at a time. Using bitwise operations makes the solution both elegant and efficient. This problem improved my understanding of bit manipulation and binary patterns. Exploring deeper into low-level concepts 🔥💪 #LeetCode #Day38 #BitManipulation #Binary #Python #ProblemSolving #CodingJourney #100DaysOfCode

LeetCode Progress Update — 18/100 Just solved “415. Add Strings” This problem was a great reminder that sometimes the best solutions come from going back to fundamentals — in this case, simulating manual addition digit by digit instead of relying on built-in conversions. Key Takeaways: Handling numbers as strings strengthens problem-solving skills Mastering carry logic is essential for many algorithmic problems Clean, efficient logic > shortcuts Problem Level: Easy Concepts: String Manipulation, Simulation Every step forward counts. On to the next one! #100DaysOfCode #DSA #LeetCode #ProblemSolving #CodingJourney #Python

🚀 Day 89 of #100DaysOfCode Solved LeetCode Problem 231 — Power of Two ✅ Cracked this one with a clean and efficient bit manipulation approach. The goal was to check whether a number is a power of two without using loops or recursion. 💡 Key Insight: A power of two has exactly one set bit in its binary form. So, using the trick: 👉 "n > 0 and (n & (n - 1)) == 0" This removes the lowest set bit — if the result is 0, it's a power of two. ⚡ Performance: • Runtime: 0 ms (Beats 100%) • Memory: 19.27 MB 🔍 What I learned: • Bit manipulation is insanely powerful • Writing optimal solutions matters • Small tricks can save big time Consistency > Motivation. On to Day 90 🔥 #LeetCode #DSA #CodingJourney #100DaysChallenge #BitManipulation #Python

Solving Subarray Sums with Ease in Python with No Prior Experience Discover how to crack the Subarray Sum Equals Zero III challenge with ease. Understand the concept of prefix sums and its application in solving subarray sums. Read the full article 👉 https://lnkd.in/d3Mg-Sjy #PythonForFresher #DataProcessing #AlgorithmsAndProgramming #ITinterviewPreparation #TechLab Code. Learn. Build. — TechLab by Neeraj

🚀 Solved today’s GeeksforGeeks POTD: URLify 🔥 Problem: Replace all spaces in a string with "%20". Approach: ✔ Used Python’s built-in "replace()" for clean and efficient solution ✔ Also explored manual iteration for better understanding 💡 Key Insight: Simple string problems build strong fundamentals and improve coding speed 🚀 ⚡ Time Complexity: O(n) Consistency is the real game changer 💯 #geeksforgeeks #dsa #python #coding #problemSolving #strings #npci#60daysofcode

Day 43/60 — GFG POTD Challenge 🔹 Problem: Consecutive 1’s Not Allowed 🔹 Approach: Dynamic Programming (Fibonacci pattern) 🔹 Time Complexity: O(n) 🔹 Space Complexity: O(1) Solved this problem by identifying a Fibonacci-like pattern to count valid binary strings without consecutive 1’s. Good practice for DP fundamentals! #geekstreak60 #npci #60DaysChallenge #GeeksforGeeks #POTD #DSA #DynamicProgramming #Python #ProblemSolving #ContinuousLearning