TomoLink
CompaniesZeptoData Structures & AlgorithmsPeeking Iterator
DSA
MediumArray

Peeking Iterator

arraydesigniterator

Problem Statement

Design an iterator that supports the peek operation on an existing iterator in addition to the hasNext and the next operations.

Implement the PeekingIterator class:

PeekingIterator(Iterator<int> nums) Initializes the object with the given integer iterator iterator .

int next() Returns the next element in the array and moves the pointer to the next element.

boolean hasNext() Returns true if there are still elements in the array.

int peek() Returns the next element in the array without moving the pointer.

Note: Each language may have a different implementation of the constructor and Iterator , but they all support the int next() and boolean hasNext() functions.

Examples

Example 1
Input:
Output:

Constraints

1 <= nums.length <= 1000
1 <= nums[i] <= 1000
All the calls to next and peek are valid.
At most 1000 calls will be made to next , hasNext , and peek .
Follow up: How would you extend your design to be generic and work with all types, not just integer?
🤔
Medium
Difficulty
Topic Info
ModuleDSA
CategoryArray
Sub-topicDesign
Tags
arraydesigniterator
Navigation
Peeking Iterator [Medium] | Zepto Dsa | TomoLink