Super Streak

The title alone does not define the input or scoring rule, so do not invent one. Start by asking whether a streak means consecutive equal values, consecutive increasing days, a longest run after deletions, or a maximum score over consecutive elements. For a plain longest consecutive run, scan once with current and best: extend current only when the stated adjacency relation holds, otherwise reset it, and update best. For a score-maximizing contiguous streak, define bestEndingHere and show exactly when it extends versus restarts, as in Kadane-style DP. The key is an explicit invariant: after index i, the state summarizes the best valid streak ending at i. That yields O(n) time and O(1) extra space for the usual one-pass variants. Cover empty input, a single element, ties, and whether the relation is strict. If the interviewer supplies extra operations, revise the state rather than forcing this template.