Repository navigation
Daily: 2026-10-19 — Merge Sorted Array - #7
Merged
Merged
Conversation
GAjay
marked this pull request as ready for review
October 21, 2026 04:58
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Problem
merge-sorted-arrayproblems/2026-10-19-merge-sorted-array/Approach
Merge from the end of
nums1using three pointers (ion the last real element ofnums1,jon the last element ofnums2,kon the write position). At each step, place the larger of the two tails intonums1[k]and move the corresponding pointer. This avoids overwriting unmerged values innums1and runs in O(m + n) time with O(1) extra space.Tests
Both commands passed locally.