Check Palindrome Using Recursion in 50 Days of Code Challenge

🚀 Day 66 of #100DaysOfCode Today, I solved LeetCode 73 – Set Matrix Zeroes, a classic problem that tests in-place matrix manipulation and optimization techniques. 💡 Problem Overview: Given a matrix, if any cell contains 0, its entire row and column must be set to 0. The challenge is to perform this efficiently without using excessive extra space. 🧠 Approach: To solve this optimally, I focused on: ✔️ Using the first row and first column as markers ✔️ Tracking whether the first row/column initially contained zero ✔️ Updating the matrix in-place based on these markers This avoids using additional space and achieves optimal performance. ⚡ Key Takeaways: In-place algorithms help reduce space complexity Using matrix itself as storage is a powerful optimization trick Handling edge cases (first row/column) is critical 📊 Complexity Analysis: Time Complexity: O(n × m) Space Complexity: O(1) Improving problem-solving skills one day at a time 🚀 #LeetCode #100DaysOfCode #DSA #Matrix #ProblemSolving #CodingJourney #SoftwareDevelopment #InterviewPrep

📄 New preprint published on Zenodo today. FlowBridge: A Zero-Cost Generalized Framework for Cross-Platform Email-to-Messaging Automation Using Browser Automation in Containerized Virtual Display Environments. 5 named subsystems: → DedupGuard — multi-signal deduplication → ClipCast — Unicode injection bypassing ChromeDriver BMP limit → SessionHeal — self-healing browser sessions in Docker → SheetConfig — spreadsheet-as-configuration → BatchForge — message aggregation engine Production result: 100% delivery accuracy, zero duplicates, $0/month infrastructure. Sole-author preprint #5. Open source. MIT license. DOI: https://lnkd.in/gidKy6BQ GitHub: https://lnkd.in/ge3RaEUr Full deep-dive article coming this week. #FlowBridge #OpenSource #Research #Zenodo #Automation #Docker #Python

🚀 Turning Simple Logic into Clean Code Recently worked on a shuffle array problem that looks tricky at first, but becomes simple with the right approach. The goal was to rearrange elements from two halves of an array in alternating order. 💡 Instead of using extra loops or complex logic, I focused on index patterns. Even indices take elements from the first half. Odd indices take elements from the second half. Using i/2 and n + i/2 made the implementation clean and efficient. ⚡ Achieved O(n) time complexity with straightforward logic. 📌 This problem reminded me that strong fundamentals in arrays and indexing are powerful. #cpp #coding #datastructures #leetcode #problemSolving

Solved “Letter Combinations of a Phone Number” on LeetCode 💡 What looks simple on the surface is actually a clean exercise in recursion + backtracking. 🔍 Key takeaways: - Mapping digits to characters is straightforward, but generating all combinations efficiently is where the thinking comes in - Backtracking helps explore all possibilities while keeping the solution clean and scalable - Important to control recursion depth and maintain state (temp) correctly 💭 What I focused on: - Building combinations incrementally - Reverting state after each recursive call (classic backtracking pattern) - Keeping the solution readable and modular This problem reinforced how powerful recursion is when combined with proper state management. On to the next one 🚀 #DSA #LeetCode #Backtracking #Recursion #ProblemSolving #CodingJourney

Day 30 of #100DaysOfCode 💻 Today’s focus: Permutation Problem Worked on generating all permutations of an array using recursion + backtracking. This problem really tested my understanding of decision trees and tracking visited elements. What stood out today: Every choice creates a new path — and managing those choices efficiently is the key. It’s interesting how a problem that looks simple at first quickly turns into a deep exercise in logic building and control over recursion. Slowly getting more comfortable with backtracking patterns 🚀 #DSA #Backtracking #Recursion #CodingJourney #LeetCode #Consistency #Day30

Day 30 of Solve With Me: Today’s problem: Reverse String (LeetCode 344). We are given a character array s. Our task is to reverse the array in-place (without using extra space). What is the idea? We swap characters from the beginning and end moving toward the center. Approach (Two Pointer ) Initialize two pointers: start = 0 end = s.length - 1 Traverse till the middle: Swap s[start] and s[end] Increment start Decrement end Stop when start >= end Why this works ? Each swap places characters in their correct reversed position. Only half traversal is needed since we fix two positions in one step. Example: Input : s = ['h','e','l','l','o'] Step 1 : swap h ↔ o → ['o','e','l','l','h'] Step 2 : swap e ↔ l → ['o','l','l','e','h'] Output : ['o','l','l','e','h'] #leetcode #problemsolving #dsa #codingpractice #day30

Palindrome Partitioning Using Backtracking 🧩 Day 10 👈 💡 Key learnings: 👉 This problem is a backtracking + partitioning pattern 👉 At each step, we try all possible prefixes 👉 Only proceed if the substring is a valid palindrome 👉 Recursively solve for the remaining string 💡 Approach: 👉 Generate substrings using a loop 👉 Check palindrome condition 👉 Build the path step by step 👉 Backtrack after exploring each possibility #DSA #Backtracking #Recursion #Algorithms #CodingJourney #LeetCode #ProblemSolving #InterviewPreparation #SoftwareEngineer #LearningInPublic

🚀 Day 82 of #100DaysOfCode Today, I solved LeetCode 41 – First Missing Positive, a classic hard problem that tests in-place array manipulation and optimization. 💡 Problem Overview: Given an unsorted array, the goal is to find the smallest missing positive integer in O(n) time and O(1) space. 🧠 Approach: ✔️ Used index-based placement (cyclic sort idea) ✔️ Placed each number x at index x - 1 whenever possible ✔️ Ignored negative numbers and values out of range ✔️ Finally, scanned the array to find the first index where the value is incorrect This ensures optimal time and space complexity without using extra data structures. ⚡ Key Takeaways: In-place manipulation can eliminate the need for extra space Index mapping is a powerful trick for array problems Hard problems often rely on simple but clever observations 📊 Complexity Analysis: Time Complexity: O(n) Space Complexity: O(1) Solving challenging problems and strengthening core fundamentals 🚀 #LeetCode #100DaysOfCode #DSA #Arrays #ProblemSolving #CodingJourney #SoftwareDevelopment #InterviewPrep #HardProblems