Questions Worth Two Minutes
The problem, read aloud to you in full:
Given an array of
nintegers, 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.
Sign in to answer questions and track your progress
Sign In