Pure Storage Set problem

Round 1

Questions: You are given an array of size N to implement a set data structure. The set should support the following operations:

• Insert(x): Insert an element x into the set, where 0 ≤ x < N.
• Remove(x): Remove an element x from the set.
• Lookup(x): Check if an element x is present in the set.
• Clear(): Clear all elements from the set.
• Iterate(): Iterate over all elements currently in the set.

All operations should have a time complexity of O(1).

Constraints:

• Elements to be stored are integers in the range [0, N-1].
• The set should be implemented using arrays of size N.
• The operations must be efficient, with all of them running in constant time.