Solved GeeksforGeeks POTD: URLify String with Python

🚀 Solved today’s GeeksforGeeks POTD: Remove Spaces 🔥 Problem: Given a string, remove all spaces while maintaining the order of characters. Approach: ✔ Used simple string manipulation ✔ Leveraged Python’s built-in "replace()" for optimal performance 💡 Key Insight: Even basic problems strengthen fundamentals and improve coding speed 💯 ⚡ Time Complexity: O(n) Consistency over complexity 🚀 #geeksforgeeks #dsa #python #coding #problemSolving #strings #npci#geekstreak60

🚀 Day 4 of #LeetCode Challenge 🔍 Problem: Reverse Integer 💡 Approach: Reversed the integer digit by digit using modulo (%) and division (/). Extract last digit using % 10 Build reversed number using rev * 10 + digit Handle negative numbers using abs() Checked for 32-bit overflow condition 🧠 Key Concept: Digit manipulation + overflow handling without using extra space. 🔥 #Day4 #LeetCode #Python #DSA #CodingJourney #Consistency

Day 06/50 – LeetCode Solved Increasing Triplet Subsequence (#334) Learned how a simple greedy approach can replace brute force: Track two values (first, second) and detect a third larger number. Result: O(n) time | O(1) space Key takeaway: Smart tracking > checking all combinations Dhanraj Sahu #Day06 #LeetCode #DSA #Python #CodingJourney

🚀 Solved today’s GeeksforGeeks Problem of the Day: Intersection of Two Sorted Arrays using Python 🐍 Problem: Find the distinct common elements between two sorted arrays. Approach: Used the efficient Two Pointer Technique 👇 ✔ Traverse both arrays simultaneously ✔ Compare elements and move pointers accordingly ✔ Skip duplicates to ensure unique results 💡 Key Insight: Since arrays are already sorted, we can avoid extra data structures and solve it in O(n + m) time. 💡 Concepts Used: Two Pointers | Arrays | Duplicate Handling This problem is a great example of how understanding input properties (sorted arrays) can drastically optimize your solution 🚀 #geekstreak60 #geeksforgeeks #dsa #python #coding #problemSolving #arrays #twopointers

🚀 Day 11 of My Python + DSA Journey Today’s problem was all about greedy approach👇 ✅ Jump Game (#55) 💡 Jump Game Check if you can reach the last index 🔍 Approach: Tracked maximum reachable index → if current index exceeds it, return False ⏱ O(n) time | O(1) space 🔥 What I learned today: • Greedy approach can simplify complex problems • Tracking max reach avoids unnecessary checks • Early exit conditions improve efficiency Turning logic into faster decisions ⚡ #Day11 #LeetCode #Python #DSA #CodingJourney #100DaysOfCode

Day 50/60 #geekstreak60 Solved Intersection of Two Sorted Arrays today. A simple yet important problem that highlights the efficiency of the two-pointer approach — allowing us to find common elements in O(n + m) time while handling duplicates smartly. Problems like these may look basic, but they strengthen core DSA thinking and improve logic with every step. 💻 #geekstreak60 #npci #DSA #Python #ProblemSolving #CodingJourney

🚀 Tackled the Mean of Range in Array problem today using prefix sums for efficient query handling. Optimized to answer each query in constant time, ensuring platform‑ready performance and hidden test case compliance. #Geekstreak2026 #Geekstreak60 #GFG #Coding #Python #DSA #ProblemSolving #GeeksforGeeks #POTD Problem Link : https://lnkd.in/gE8qbfG6 Solution Link : https://lnkd.in/grPTmTvj

🚀 LeetCode Progress Update Just solved LeetCode 2828 – Check if a String Is an Acronym of Words ✅ 💡 Key Idea: Compared the first character of each word with the corresponding character in the given string — simple logic, but a great reminder that clarity beats complexity! 🧠 What I learned: Importance of index-based comparison Writing clean and readable conditions Thinking in terms of patterns, not just code ⚡ Result: Accepted with 1 ms runtime 💻 Consistency is the goal — one problem at a time! 🔥 #LeetCode #100DaysOfCode #Python #CodingJourney #ProblemSolving #Consistency #DataStructures

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 49/60 #geekstreak60 Solved Segregate 0s and 1s today. A simple yet useful problem that teaches the power of the two-pointer approach — solving efficiently in O(n) time and O(1) space without extra memory. Small problems like these build strong problem-solving habits step by step. 💻 #geekstreak60 #npci #DSA #Python #ProblemSolving #CodingJourney