TomoLink
CompaniesZeptoData Structures & AlgorithmsRLE Iterator
DSA
MediumArray

RLE Iterator

arraydesigncounting

Problem Statement

We can use run-length encoding (i.e., RLE ) to encode a sequence of integers. In a run-length encoded array of even length encoding ( 0-indexed ), for all even i , encoding[i] tells us the number of times that the non-negative integer value encoding[i + 1] is repeated in the sequence.

For example, the sequence arr = [8,8,8,5,5] can be encoded to be encoding = [3,8,2,5] . encoding = [3,8,0,9,2,5] and encoding = [2,8,1,8,2,5] are also valid RLE of arr .

Given a run-length encoded array, design an iterator that iterates through it.

Implement the RLEIterator class:

RLEIterator(int[] encoded) Initializes the object with the encoded array encoded .

int next(int n) Exhausts the next n elements and returns the last element exhausted in this way. If there is no element left to exhaust, return -1 instead.

Examples

Example 1
Input:
Output:

Constraints

2 <= encoding.length <= 1000
encoding.length is even.
0 <= encoding[i] <= 10 ^9
1 <= n <= 10 ^9
At most 1000 calls will be made to next .
🤔
Medium
Difficulty
Topic Info
ModuleDSA
CategoryArray
Sub-topicDesign
Tags
arraydesigncountingiterator
Navigation
RLE Iterator [Medium] | Zepto Dsa | TomoLink