---
title: "Discussion on \"Day-1 Leetcode Interview Questions\" | Hashnode"
description: "Discussion on \"Day-1 Leetcode Interview Questions\". 88. Merge Sorted Array — LeetCode (Easy)\nProblem Summary\nYou are given two sorted arrays:\n\nnums1 of size m + n, where the first m elements are valid, and the last n elements are zeros (placeholders).\n\nnums2 of size n, containing sorted values.\n\n\nYour..."
url: "https://hashnode.com/posts/day-1-leetcode-interview-questions/691660c2596a8f51a83a6a59"
---

[Feed](https://hashnode.com/feed) /

Discussion

# [Day-1 Leetcode Interview Questions](https://compscigrad.hashnode.dev/day-1-leetcode-interview-questions?utm_source=hashnode&utm_medium=feed)

88\. Merge Sorted Array — LeetCode (Easy) Problem Summary You are given two sorted arrays: nums1 of size m + n, where the first m elements are valid, and the last n elements are zeros (placeholders). nums2 of size n, containing sorted values. Your...

Nov 13, 2025 · 3 min read · compscigrad.hashnode.dev  
Read the article

-   [#java](https://hashnode.com/tag/java)
-   [#leetcode](https://hashnode.com/tag/leetcode)
-   [#leetcode-solution](https://hashnode.com/tag/leetcode-solution)
-   [#computer-science](https://hashnode.com/tag/computer-science)

## Written by

[Geetha Haveela](https://hashnode.com/@geethahaveela)

@geethahaveela

  
[View profile](https://hashnode.com/@geethahaveela)

Geetha22

## Responses

Markdown supported · ⌘↵ to post

No responses yet.
