Available question text
Given an array "changed" that was formed by taking some unknown "original", appending twice each element, and shuffling, return any valid original array or [] if impossible. The core challenge is to determine whether the multiset can be partitioned into pairs (x, 2x) (including special handling for zeros and duplicates) using frequency matching in increasing order.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 2007. Find Original Array From Doubled Array
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source