Solved LeetCode 415 Add Strings with String Manipulation

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

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

🚀 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 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

Day 27/100 – DSA Practice Solved LeetCode 459: Repeated Substring Pattern today. Key Insight: If a string s is formed by repeating a substring, then it will always exist inside: (s + s)[1:-1] Why this works: Doubling the string generates all possible rotations Removing first & last characters avoids trivial matches If s is found in this modified string, it confirms a repeating pattern This elegant trick reduces the problem to a simple one-liner and highlights the power of pattern observation in strings. Approach Used: return s in (s + s)[1:-1] Constant progress > Perfection. On to the next one! #Day27 #100DaysOfCode #DSA #LeetCode #Python #CodingJourney #ProblemSolving

Day 42 of consistency 🚀 Today’s problem was about counting binary strings of length n without consecutive 1s. A simple-looking question, but it beautifully turns into a DP + Fibonacci pattern problem. Key takeaway: not every counting problem needs brute force — sometimes, just tracking valid endings is enough. Little by little, these patterns start repeating — and that’s where real improvement happens. #GeeksforGeeks #DSA #Python #DynamicProgramming #CodingJourney #ProblemSolving #100DaysOfCode #geekstreak60 #npci

🚀 Day [21] of #Geekstreak60 Today’s #POTD was Two Equal Sum Subarrays — a neat exercise in prefix sums, binary search, and validation logic. I solved it in Python using multiple approaches: ✅ Direct prefix sum check ✅ Hash set tracking for generalized detection ✅ Binary search on prefix array for efficient lookup Each method reinforces how different strategies can converge on the same solution, sharpening problem‑solving skills and adaptability. #Coding #Python #Geekstreak60 #ProblemSolving #DSA #GeeksforGeeks #Geekstreak2026 Problem Link : https://lnkd.in/gzdaVpnr Solution Link : https://lnkd.in/gvdHSgwR

Day 110 Same pattern, new constraint. #Day110 🧩 90. Subsets II How today went: • Very similar to the basic Subsets problem • First step: sort the array • While iterating, skip duplicate elements to avoid repeating subsets • Use the same backtracking pattern: append → recurse → pop What I learned: The core pattern stays the same — only the duplicate handling logic changes. This small condition makes a big difference. Backtracking is becoming more predictable now. #LeetCode #DSA #Python #Backtracking #Recursion #LearningInPublic #Consistency

🚀 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 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