Remove Element (LeetCode #27) - Two Pointers Technique

🚀 Day 39 of #100DaysOfCode Solved Add Binary today! Problem: Given two binary strings, return their sum as a binary string. At first glance, it looks simple — but the key is handling: ✔ Carry correctly ✔ Different string lengths ✔ Edge case when carry remains at the end Instead of converting to integers, I implemented the manual binary addition approach (right to left with carry). This ensures the solution works efficiently even for very large inputs. 🧠 Key Learning: Sometimes the best solution is to simulate the real-world process (just like how we do pen-and-paper addition). ⏱ Time Complexity: O(n) 📦 Space Complexity: O(n) Consistency > Motivation 💪 On to Day 40 🔥 #Day39 #LeetCode #Binary #ProblemSolving #CodingJourney #Python #DSA

Day 42 ✅ | Reverse Linked List Revisited one of the most important linked list problems today. The goal is to reverse the list in-place by carefully adjusting node pointers. Key ideas used: Maintain prev and curr pointers Temporarily store the next node Reverse links step by step while traversing the list This problem is a great reminder that mastering the basics makes harder problems much easier 💪 #Python #LeetCode #LinkedList #ReverseLinkedList #ProblemSolving #Day42 #CodingJourney #DSA #Algorithms #DataStructures

🚀 Day 11/30 – Defining & Calling Functions in Python Today, I learned how to write cleaner and smarter code using functions. Instead of repeating the same logic multiple times, we can define it once and reuse it whenever needed. That’s powerful. 📌 What I practiced: • Defining a function using def • Calling the function • Passing values (arguments) • Returning results Here’s a simple example I built today: . 💡 Key Takeaway: Functions make programs organized, efficient, and professional. Small concept. Big impact. Day 11 complete ✅ #Python #30DaysChallenge #LearningInPublic #ProgrammingJourney #Consistency Aditya ChaturvediJECRC UniversityYash Raj ChoudharyRaj Gehlot

📌 Day 25 of #100DaysOfCode Today’s problem: LeetCode 14 – Longest Common Prefix This problem looks simple… but it tests your string fundamentals and edge-case handling. 🧠 Problem Insight: We are given an array of strings. Our task is to find the longest common prefix among all strings. If there is no common prefix → return an empty string. 🔎 Key Learning: The prefix must match character by character The shortest string limits the maximum possible prefix Early stopping is important once mismatch is found Edge cases: Empty array Only one string No common prefix 🎯 What I Practiced Today: ✔️ String traversal ✔️ Breaking early for optimization ✔️ Handling corner cases ✔️ Clean logic without overcomplication Small problem. Big clarity improvement. Consistency > Motivation 🔥 #Day25 #LeetCode #DSA #Python #CodingJourney #ProblemSolving #100DaysOfCode

Python Clarity Series – Episode 3 Topic: input() confusion (string vs int) 🤯 Why does this code not work? x = input("Enter a number: ") print(x + 5) Many students get an error here. Reason? 👇 👉 input() always takes value as STRING So: "x" + 5 ❌ (Error) int(x) + 5 ✅ (Correct) 💡 Fix: x = int(input("Enter a number: ")) This small concept is tested frequently in exams. Students—did this ever confuse you? #PythonLearning #CodingBasics #StudentConfusion

Day 32 of #100DaysOfCode 🚀 Today’s LeetCode lesson wasn’t about algorithms — it was about reading errors carefully. 🔍 Problem: Minimum Removals to Balance Array 💡 Approach: Sorting + Sliding Window (Two Pointers) But I hit a Runtime Error even though my logic was correct. Takeaways: Always match the exact function name expected by the platform Don’t panic on runtime errors — read the driver message carefully Logic can be perfect, but naming matters 🧠 Final solution uses: Sorting Two pointers O(n log n) time complexity Consistency > Speed. Small details > Big mistakes. On to the next problem 💪 #100DaysOfCode #LeetCode #Python #DSA #ProblemSolving #CodingJourney #LearningByDoing

🚀 Solved Today’s POTD (28 Feb 2026): Find the Closest Pair from Two Sorted Arrays on GeeksforGeeks using Python 🐍 Problem: Given two sorted arrays and a target value x, find a pair (one element from each array) whose sum is closest to x. Approach: 🔹 Used the Two Pointer technique 🔹 Started one pointer at the beginning of arr1 and the other at the end of arr2 🔹 Compared the current sum with x and adjusted pointers intelligently 🔹 Tracked the minimum absolute difference Why this works? Since the arrays are sorted, we can move pointers strategically instead of checking all pairs — reducing time complexity from O(n*m) to O(n + m). This problem strengthened my understanding of: ✔️ Two Pointer optimization ✔️ Leveraging sorted properties ✔️ Writing efficient solutions over brute force 💡 Time Complexity: O(n + m) Daily practice. Better patterns. Sharper thinking. 💪 #day12 #geekstreak60 #npci #geeksforgeeks #dsa #python #learning #problemsolving

🧩 Problem: Remove Duplicates from Array (LeetCode #26) 💡 Concept Learned: This problem taught me the importance of In-place Modification. Instead of creating a new list, I modified the original array to save memory, ensuring the first k elements are the unique ones. 🔍 Key Insight: The Memory (Set): I used a Python Set to instantly check if a number was already seen.The Writer (Pointer k): I maintained a pointer k to track where the next unique element should be placed.The Strategy: When a "new" number is found, I overwrite nums[k] and increment k. This keeps all unique values at the front of the line. 🎯 Key Takeaway: Indentation is Logic: In Python, the placement of a return statement is the difference between a finished loop and an early exit. Efficiency: Using a Set makes lookups , making the overall solution time complexity. Growth: Every bug (like a NameError or a misplaced return) is just a lesson in disguise. 📈 Slowly building confidence by solving one problem at a time and learning from mistakes. #DSA #LeetCode #100DaysOfCode #TwoPointers #ProblemSolving #Python #CodingJourney #LearningInPublic #CodeNewbie

Day 96 – LeetCode Journey Another step forward in consistency and problem-solving discipline. Today’s problem: Find the Distance Value Between Two Arrays Key learning: Understanding “there is NOT ANY element…” type conditions. Using nested loops with proper break logic. Leveraging Python’s for-else construct effectively. Strengthening brute-force reasoning before optimization. Result: ✅ 103 / 103 test cases passed ⚡ Runtime: 47 ms 💾 Memory efficiency: Strong performance Every day isn’t about solving the hardest problem — it’s about sharpening logic and avoiding small mistakes. Consistency > Intensity. #Day96 #LeetCode #ProblemSolving #Python #DSA #Consistency #100DaysOfCode