Skip to the editor
JSGroundwork
JSGroundwork handwritten · web dev
←Back to Hashing

Ready to read

JSJavaScript⑂Git◎Interview prepΣDSA in JSSDSystem Design
More topics15›
</>HTML{ }CSS⚛ReactNNext.jsNeNest.jsTSTypeScriptNoNode.js🐳DockerDBSQL & Databases✓Testing🔒Web Security☁Cloud & DevOps◈GraphQL◆Redis☸Kubernetes
☰‹›
Description
All topics›JavaScript›Hashing

Longest Consecutive Sequence

advancedlayer B3 · Hashing5 tests

Given an unsorted integer array nums, return the length of the longest run of consecutive integers you can form from its values. The values do not have to be adjacent in the array.

  • Your algorithm must run in O(n) time — sorting is not allowed
  • Duplicates count only once: [1,2,2,3] has a run of length 3
  • Negative numbers are allowed
  • An empty array returns 0

Stuck?

All exercisesPlayground
1234567891011121314
loading the editor…

Nothing yet — hit Run and whatever you log shows up here.

Submit to see how you did.

⌘/Ctrl + Enter run⌘/Ctrl + S save⌘/Ctrl + / comment⌘/Ctrl + F find/replace⌘/Ctrl + D select next matchAlt + click multi-cursorTab indent · ⇧Tab outdentEsc leave fullscreen