Add implementation for merging two sorted arrays in TypeScript using … #5
Conversation
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
…an in-place approach. Includes comments on status and time taken for reference.
…mplementation in TypeScript for cleaner code.
Contributor
There was a problem hiding this comment.
Pull Request Overview
This PR implements a solution for LeetCode problem 88 (Merge Sorted Array) in TypeScript. The implementation merges two sorted arrays by modifying the first array in-place using a two-pointer approach that fills from the end of the array.
- Implements an efficient O(m+n) time, O(1) space solution using reverse iteration
- Uses three pointers to merge arrays from back to front, avoiding overwrites
- Handles remaining elements from nums2 when nums1 elements are exhausted
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.
Status
Accepted
Time Taken
10 m 59 s