💻 Day 3/100 of #100DaysOfCode Problem solved: Merge Sorted Array (LeetCode #88) ⚡ Learned: Merging two sorted arrays in-place 🧠 Complexity: O((m + n) log(m + n)) → optimized approach 🎯 0 ms runtime | 95% memory efficiency 🔥 #DSA #LeetCode #CodingJourney #Striver