1775. Design an Ordered Stream
My accepted Python solution to LeetCode problem 1775, Design an Ordered Stream, running in 19ms.
- Difficulty: Easy
- Python
- Runtime 19ms
- Memory 18.4MB
- Updated
Read the problem on LeetCode View on GitHub
The problem statement is LeetCode’s and stays on their site. What follows is my accepted solution.
Python
Accepted on LeetCode — runtime 19ms, memory 18.4MB, accepted 2025-12-30.
class OrderedStream:
def __init__(self, n: int):
self.stream = [None] * (n + 1)
self.ptr = 1
def insert(self, idKey: int, value: str) -> List[str]:
self.stream[idKey] = value
result = []
while self.ptr < len(self.stream) and self.stream[self.ptr]:
result.append(self.stream[self.ptr])
self.ptr += 1
return result