Available question text
Merge two sorted lists of [id, value] pairs with unique ids into a single list sorted by id, summing values for ids that appear in both (treat missing ids as 0). The core challenge is merging two sorted arrays and combining entries with matching keys.
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 2570. Merge Two 2D Arrays by Summing Values
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source