Find Consecutive Integers from a Data Stream — LeetCode 2526 Python Solution

The problem

For a stream of integers, implement a data structure that checks if the last k integers parsed in the stream are equal to value. Implement the DataStream class: DataStream(int value, int k) Initializes the object with an empty integer stream and the two integers value and k.

Example

Input

["DataStream", "consec", "consec", "consec", "consec"]

Output

[null, false, false, true, false]

Explanation

DataStream dataStream = new DataStream(4, 3); //value = 4, k = 3

Python solution

class DataStream:
    def __init__(self, value: int, k: int):
        self.val, self.k = value, k
        self.cnt = 0

    def consec(self, num: int) -> bool:
        self.cnt = 0 if num != self.val else self.cnt + 1
        return self.cnt >= self.k


# Your DataStream object will be instantiated and called as such:
# obj = DataStream(value, k)
# param_1 = obj.consec(num)

Complexity

Pattern: Stack

When the most recent unresolved thing is the one that matters, use a stack. LeetCode 2526. Find Consecutive Integers from a Data Stream is filed here because LeetCode tags it Queue, which is the vocabulary this hub collects.

The stack guide has the Python template for the pattern and the 194 LeetCode problems that use it.

Related problems