Output: k = 5, nums = [0,1,3,0,4,_,_,_]

✨ Pro Tips for Interviews

1. Clarify requirements: Ask if modifying the array order is allowed (it is for this problem).


2. Edge cases:
   
   
   
   
   • Empty array (nums = []).
   
   
   • val not in nums.
   
   
   • All elements equal to val.
   
   
   
   

📝 Summary

The two-pointer technique is a powerful strategy for array problems requiring in-place modifications. By understanding how to use this pattern, you can tackle many similar challenges efficiently.

📚 Learn More

Check out the full explanation and code walkthrough on Dev.to:

👉 Merge Sorted Array - JavaScript Solution

How would you solve this problem? Drop your ideas or alternate approaches in the comments! 🚀

JavaScript #LeetCode #CodingInterview #ProblemSolving