The divide and conquer approach hits different when you see it working. O(n log n) time complexity but the extra space for temp array. #StriverA2Z #DSA #Java #MergeSort #LearningInPublic

🔄 Day 187/365 #365DaysOfCode ✅ 🔥 Solved : Merge Sorted Array! ⚡ Approach: Three Pointers (Backward) ⏱️ T.C: O(m+n) 💾 S.C: O(m+n) 💡 Key Insight: Merge backwards to avoid overwriting! #DSA #MergeSort #TwoPointers #algorithms #LeetCode #ProblemSolving

keyboard_arrow_left Previous keyboard_arrow_right Next

Check out my latest article: #Lazy #Mergesort in #Haskell: Unlocking Surprising Efficiency in #Algorithm Composition linkedin.com/pulse/lazy-mer… via @LinkedIn

🟢 Day 141/160 of the #GFG160 Challenge – 14 August 2025 ✅ POTD – Count Reverse Pairs 🔄 Solved using modified merge sort to count reverse pairs efficiently in O(n log n) time. #GFG160 #GeekStreak2025 #DivideAndConquer #MergeSort #TwoPointers #100DaysOfCode @geeksforgeeks

Day 34: Divide & Conquer Mode ⚔️ ✅ Counting Reverse Pairs – solved with Merge Sort for O(n log n) efficiency ✅ Binary Search – both Recursive & Iterative approaches 🔍 Halving arrays, doubling skills 💡 #Day34 #DSA #MergeSort #BinarySearch #100DaysOfCode #LearningJourney

Day 33: Inversion Count 🔁 ✅ Implemented Brute (O(n²)) ✅ Implemented Optimal using Merge-Sort (O(n log n)) — much faster for big arrays! ⚡ Small wins add up.👨‍💻 #Day33 #DSA #InversionCount #MergeSort #100DaysOfCode

📘 Java Learning – #Day 24 🔸 Topic: Merge Sort ✅ Mastered Divide & Conquer ✅ Recursive Split → Merge ✅ Time: O(n log n), Space: O(n) 💡 Efficient, stable sorting for large datasets #Java #DSA #MergeSort #100DaysOfCode #Sorting #CodingJourney

keyboard_arrow_left Previous keyboard_arrow_right Next

Build a Sorting Algorithm Visualizer in Python #Python #Algorithm #Sorting #MergeSort #BubbleSort plainenglish.io/blog/build-a-s…

✅ Day 30 of #100DaysOfCode Solved "Sort List" 📈 on LeetCode — implemented efficient merge sort on linked list using divide and conquer for O(n log n) time complexity. #LeetCode #LinkedList #SortList #MergeSort #Python #DSA #ProblemSolving #100DaysChallenge #DrGVishwanathan

Felt a bit off today Attended ~7 lectures – some okay, some zoned out 😅 Watched random #Striver vids – #Hashing, #Recursion, #MergeSort, but barely grasped anything Skimmed through class notes 📝 Did 45 mins at the #gym, not productive #StudentLife #CS

🐦 Day 19 – #100DaysOfDSA 🔁 Learned Merge Sort (Recursive) 🐞 Fixed a bug in merge() – was using wrong variable! 🧠 Visualized the call stack step-by-step 🛠️ Tip: Always dry-run recursive code! #JavaScript #DSA #Coding #MergeSort #Recursion #100DaysOfCode @akshaymarch7

keyboard_arrow_left Previous keyboard_arrow_right Next

Day 27 of Learning java with @kunalstwt Today i explored the Merge Sort algorithm , one of the most efficient sorting techniques. It uses a DIVIDE AND CONQUER strategy to recursively divided the array and merge in sorted order. #60DaysOfLearning2025 #DSAwithKunal #Mergesort #DSA

🚀 Day 122 of #100DaysOfCode ✅ Solved Merge Sort on LeetCode 🧠 Implemented recursive merge logic with dynamic memory allocation 📊 Runtime: 244 ms (Beats 53.77%) 💾 Memory: 156.2 MB (Beats 39.09%) Keep learning, keep sorting! 🔁💡 #LeetCode #CPP #DSA #MergeSort #CodingJourney

Just wrapped my head around divide and conquer algorithms like Merge Sort and Quick Sort. It took a few tries, but I finally get it! #algorithms #coding #mergesort #quicksort #programming

One sorted layer at a time. #90DaysOfGrind #MergeSort #DivideAndConquer #DSA #LearningInPublic #FrontendEngineer #ClarityAndCode #GrowthMindset

🧩 Day 52 of #100DaysOfCode x #DSA 📘 Topic: Merge Sort Algorithm ✅ Covered: • Divide & Conquer strategy • Recursive breakdown of array • Merging sorted halves • Clean implementation using recursion #DSA #Sorting #MergeSort #100DaysChallenge #CodeNewbie

🚀 DSA #Day 10 ✅ Topic: Merge Sort 🔹 Divide & Conquer 🔹 Recursively split array 🔹 Merge sorted halves ✅ Always O(n log n) ✅ Stable ✅ Great for linked lists & large data ⚠️ Needs O(n) extra space 💻 Practiced recursion + merge() logic #DSA #MergeSort #Java #100DaysOfCode

keyboard_arrow_left Previous keyboard_arrow_right Next

Day 36/100 #100DaysOfCode 📍Solved Reverse Pairs 🔁 ✅ Brute force ✅ Optimized (Merge Sort 🔥) DSA grind continues. Just 1 problem a day = consistent growth 💪 #DSA #CodingLife #MergeSort #DevLog

✅ Day 13/90 – Progress Update 💻 Solved LeetCode’s daily challenge (String) 📘 DSA: Started Divide and Conquer (Studied Merge Sort) 📗 Core: Revised Chapter 1 – OSI Model (Computer Networks) Inspired by @akshaymarch7 💯 #90DaysOfCode #MERNStack #DSA #MergeSort #CN #OSIModel

keyboard_arrow_left Previous keyboard_arrow_right Next

✅ Solved 912. Sort an Array on LeetCode using Merge Sort . It was a great way to understand divide-and-conquer and how merge sort works under the hood! #DSA #MergeSort #SortAnArray #DivideAndConquer @ChaiCodeHQ @PrateekJain027