2 / 2 Reading The Problem & Restating It

Questions Worth Two Minutes

The problem, read aloud to you in full:

Given an array of n integers, find the longest block of consecutive elements in which no value repeats.

You get two minutes of clarification before you are expected to start. More than one of the questions below changes what you write; select every one that does.

A

"If two blocks tie for longest, which one do you want?"

B

"Are the values bounded by 10610^6, so I could index an array instead of hashing?"

C

"When you say a block of consecutive elements, do you mean adjacent positions, or elements whose values run consecutively?"

D

"Do you want the block itself, or only its length?"

E

"Can the values be negative?"