Practice Microsoft Coding Question | Real Coding Interviews | Hack2hire

NewML System Design & SQL tracks just landedSee what's new

Question Bank Pricing Blog Forum

Quick Summary

Merge two pre-sorted integer arrays into a single sequence.
Ensure every distinct value appears exactly once in ascending order.
Efficiently filter duplicates without relying on auxiliary hash-based collections.

What This Tests

Two-pointer traversal technique
Stream-based duplicate filtering
Time and space complexity optimization
Array boundary and edge case handling

Common Patterns

Two Pointers

Accepted

64/198

Acceptance Rate32.3%

Test Cases

Input

nums1 =

nums2 =

Output

Expected