Available question text
Given two run-length encoded arrays (lists of [value, frequency] pairs) representing two sequences, compute the element-wise product sequence and return its run-length encoding, merging consecutive equal products. The core challenge is a two-pointer consumption of runs (subtracting counts and emitting/combining product runs) in linear time in the number of runs.
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 1868. Product of Two Run-Length Encoded Arrays
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source