The Runtime Theory
mediumLeetCode#hash-set#sequence-starts

Longest Consecutive Sequence

Return the length of the longest run of consecutive integer values, regardless of input order.

The Runtime Theory Team25 min read
Solve it

Solving happens on the judge — come back and mark it done

Sample cases

innums=[100,4,200,1,3,2]

out4

innums=[0,3,7,2,5,8,4,6,0,1]

out9

innums=[]

out0

Return the length of the longest run of consecutive integer values, regardless of input order.

A good solution should

  • State the invariant or decision rule that makes the approach correct.
  • Explain the time and space complexity in terms of the input sizes and required output.
  • Handle empty, minimal, duplicate, and boundary-shaped inputs covered by the contract.

Reasoning prompt

Avoid sorting for the linear-time target. Start a run only when its predecessor is absent, and account for duplicates.

Use the linked judge for the canonical problem. The examples above are compact TRT checks; write additional cases before submitting, especially for the boundary that tends to break your chosen invariant.

More practice in this topic

easy · arraysContains Duplicatemedium · arraysEncode and Decode a List of Stringsmedium · arraysGroup Anagrams

One dispatch a week

The trace behind each problem, the tradeoff that explains it, and one technical dispatch per week — no noise.

One technical dispatch per week. No noise.

Not started

Sign in to save your learning progress.

Sign in to save