Merging Sorted Arrays in LeetCode Challenge

🚀 Day 8 of My LeetCode Journey — Divide & Conquer Today’s problem: Sort an Array (LeetCode 912) 💡 Approach: Merge Sort (Recursive) Instead of using built-in sorting, I implemented a recursive solution using the Divide & Conquer technique. 👉 Break the array into halves 👉 Recursively sort each half 👉 Merge the sorted halves using a helper function Creating a separate merge function to combine two sorted arrays made the logic clean and modular. 🧠 What I Learned: Recursion becomes powerful when combined with Divide & Conquer Breaking problems into smaller pieces simplifies complex logic Writing helper functions improves code readability and reuse ⚡ Complexity: ⏱️ Time: O(n log n) 📦 Space: O(n) 🔥 This problem felt like a step up from basic sorting (Bubble/Selection). Understanding how efficient sorting actually works under the hood was a great experience. Thanks to Namaste DSA and Akshay Saini 🚀 for the guidance Day 9 loading… 💪 #LeetCode #DataStructures #Algorithms #CodingJourney #100DaysOfCode #SoftwareEngineering #Programming #InterviewPrep #JavaScript #CodingLife #TechGrowth #ProblemSolving #Developers #LearnToCode #MergeSort #Recursion #DivideAndConquer #NamasteDSA

🚀 Day 10 of My LeetCode Journey — Mastering Linked Lists Today’s problems: 🔹 Middle of the Linked List (LeetCode 876) 🔹 Reverse Linked List (LeetCode 206) 💡 Problem 1: Middle of the Linked List Used the classic slow & fast pointer approach: 👉 Slow moves 1 step 👉 Fast moves 2 steps 👉 When fast reaches the end → slow is at the middle 🎯 Such a simple trick, yet super powerful! 💡 Problem 2: Reverse Linked List This one is a must-know 🔥 👉 Iteratively reverse pointers 👉 Keep track of prev, current, and next 👉 Flip links step by step Also explored how this can be done using recursion 🧠 What I Learned: Two-pointer techniques are extremely useful Pointer manipulation builds real confidence in DSA Linked Lists are all about careful handling of references 🔥 Key Takeaways: Small tricks (like slow/fast pointers) can simplify problems a lot Practicing core problems like reversing a linked list is essential for interviews Understanding the logic > memorizing code Grateful for the learning journey with Namaste DSA and Akshay Saini 🚀 🙌 Day 11 loading… 💪 #LeetCode #DataStructures #Algorithms #CodingJourney #100DaysOfCode #SoftwareEngineering #Programming #InterviewPrep #JavaScript #CodingLife #TechGrowth #ProblemSolving #Developers #LearnToCode #LinkedList #ReverseLinkedList #TwoPointers #NamasteDSA

🚀 Day 4 of My LeetCode Journey — Building Problem-Solving Muscle Today I worked on two problems: 🔹 Max Consecutive Ones (LeetCode 485) 🔹 Missing Number (LeetCode 268) 💡 Problem 1: Max Consecutive Ones This problem is all about pattern recognition. 👉 Traverse the array 👉 Keep counting consecutive 1s 👉 Reset when you hit 0 Simple logic, but a great reminder that not every problem needs complex data structures. 💡 Problem 2: Missing Number This one was interesting — multiple ways to solve it: ✔️ Sorting ✔️ HashSet ✔️ XOR ✔️ Sum formula (most optimal) The cleanest approach: 👉 Use the formula: n * (n + 1) / 2 👉 Subtract the actual sum 👉 Boom — missing number found ⚡ 🔥 Key Takeaways from Today: Not every problem needs brute force There’s always a more optimal way — look for patterns Understanding multiple approaches = stronger fundamentals Consistency is slowly turning confusion into clarity 💪 On to Day 5 🚀 #LeetCode #DataStructures #Algorithms #CodingJourney #100DaysOfCode #SoftwareEngineering #Programming #InterviewPrep #JavaScript #CodingLife #TechGrowth #ProblemSolving #Developers #LearnToCode #Consistency #CodeNewbie #DailyCoding

Been spending some time revisiting fundamentals lately — and honestly, nothing beats clean, simple code. In a world full of frameworks and shortcuts, it’s easy to forget that strong basics still do most of the heavy lifting. A few small snippets I’ve been reflecting on: Python # Clean and readable always wins def find_max(numbers): return max(numbers) if numbers else None JavaScript // Simplicity > over-engineering const uniqueItems = arr => [...new Set(arr)]; SQL -- Good queries save hours later SELECT customer_id, COUNT(*) AS total_orders FROM orders GROUP BY customer_id ORDER BY total_orders DESC; Nothing fancy here — but that’s the point. The real difference often comes from writing code that: someone else can understand quickly you can debug without frustration actually scales without breaking everything Tech keeps evolving, but clarity, structure, and logic never go out of style. Curious — what’s one coding principle you always stick to, no matter the language or stack? #Coding #Technology #SoftwareDevelopment #CleanCode #Programming #Developers

🚀 Day 4 of my Coding Challenge Today's problem was simple but a great reminder of string fundamentals in JavaScript. Problem Statement Given a string s, return the last character of the string. Example Input: "learncoding" Output: "g" Any language Approach Use string indexing with length - 1 to access the last character. function getLastCharacter(s) { return s[s.length - 1]; } console.log(getLastCharacter("learncoding")); // g Key Learning:- Strings are index-based length - 1 always points to the last character Small problems help strengthen core programming logic Consistency matters more than complexity. One problem every day 📚 #CodingChallenge #Day4CodingChallenge #JavaScriptDeveloper #DSA #DataStructures #Algorithms #ProblemSolving #CodingJourney #CodeDaily #LearnToCode #DevelopersLife #SoftwareDeveloper #FrontendDeveloper #FullStackDeveloper #TechCommunity #ProgrammingLife #CodeNewbie #CodingPractice #DeveloperJourney #CodingSkills #TechLearning #JavaScriptCoding #WebDeveloper #ProgrammingChallenge #DailyCoding #CodeMotivation #CareerInTech #DeveloperMindset #CodingGrind #TechGrowth

🚀 Day 24 of My Coding Journey — Power of Two Today’s problem was “Power of Two” — a simple-looking question that really highlights the beauty of bit manipulation. 🔍 What I learned: Instead of using loops or recursion, I explored how binary representation works. A power of two always has only one set bit (1) in its binary form — and that insight leads to a super efficient solution. 💡 Key trick: n & (n - 1) === 0 This removes the lowest set bit, and if the result is zero, the number is a power of two. ⚡ Takeaway: Sometimes the most optimized solutions come from understanding how data is represented internally, not just from writing more code. 📈 Progress: Day by day, I'm getting more comfortable with problem-solving patterns and thinking beyond brute force approaches. #128DaysOfCode #LeetCode #JavaScript #CodingJourney #ProblemSolving #BitManipulation

"Coding is easy... Debugging is dangerous." 😅 We’ve all been there. During my early days of learning to code, I once spent 2 solid hours pulling my hair out over a program that just wouldn't run. I checked the loops, scrutinized the syntax, and even completely rewrote the entire code from scratch. The result? The exact same error. The culprit? A single, missing semicolon. ; It’s these frustrating, beginner-level debugging moments that truly teach us patience and attention to detail. Today, as a Full Stack Developer building out applications with Python, Django, and React, I look back at that missing semicolon as a right of passage. The tech stack may have changed, but the lesson remains the same: debugging isn't just about fixing code; it's about building resilience and problem-solving skills. I just dropped a quick YouTube short sharing this classic developer moment. Check it out here: 🔗 https://lnkd.in/gp_kyQXN What was your most frustrating "missing semicolon" or tiny bug moment that took hours to find? Let's hear your debugging horror stories in the comments! 👇 #WebDevelopment #PythonDeveloper #FullStackDeveloper #CodingLife #Debugging #SoftwareEngineering #ReactJS #TechJourney #ChennaiTech

Longer autonomous coding runs lead to longer reviews. This is how you make them fast again. Your bug count may be infinite but your threat model is finite. If you build a TypeScript and Python app you likely have SSRF (when your server makes HTTP requests on behalf of the user) and missing/incorrect authorization bugs. The road to asurance AND velocity is paved with ”define and conquer”. Define an input filter for URLs and scan for fetch and request lib calls that don't use it. This can be a lint rule. Your app roles have purposes and flows. Define these to make an allowed calls definition. Peak into the tests/ directory for playwright tests that you can use to reach all features with lower than expected roles. Clear definitions and types are what makes things verifiable at speed.

🚀 Starting your coding journey? Here’s a simple visual roadmap to go from zero to real projects. I’ve put together a beginner-friendly guide to help anyone navigate the early (and sometimes overwhelming) stages of learning to code. No fluff — just a clear path forward. ✅ Pick your first language ✅ Master core concepts ✅ Build small projects ✅ Practice daily ✅ Level up with real-world tools Whether you want to build websites, automate tasks, or create your first app — this map will keep you on track. Coding isn’t about being a genius. It’s about consistency, curiosity, and creating. Save this for later or share it with someone who’s taking their first step today. 👩💻🧠 #LearnToCode #CodingForBeginners #PersonalBranding #TechJourney #Python #JavaScript #WebDevelopment #100DaysOfCode #CodingRoadmap #DeveloperCommunity

🚀 Day 561 of #750DaysOfCode 🚀 📌 Problem: Minimum Distance to the Target Element Today’s problem was simple yet a great reminder of how powerful basic iteration can be when applied correctly. 🔍 The task was to find the minimum distance between a given start index and any index i such that nums[i] == target. 💡 Key Insight: Instead of overthinking, just iterate through the array and track the minimum value of |i - start| whenever the target is found. Clean, efficient, and effective. 🧠 What I Learned: Sometimes brute force with clarity is the best solution Always look for opportunities to minimize operations with simple logic Writing clean and readable code matters as much as solving the problem ⚡ Approach: Traverse the array Check for target Update minimum distance ⏱️ Complexity: Time: O(n) Space: O(1) 💻 Consistency is key. Small steps every day build strong problem-solving skills over time. #leetcode #dsa #programming #java #coding #developers #softwareengineering #100daysofcode #codingjourney #tech #learning #growth