| about | help | code help+videos | done | prefs |
Given an unsorted int[], find the length of the longest consecutive sequence of integers. You must solve it in O(n) time, so no sorting allowed. A HashSet is the key tool you will want to use in this problem. longestConsecutive([1]) → 1 longestConsecutive([]) → 0 longestConsecutive([100, 4, 200, 1, 3, 2]) → 4 ...Save, Compile, Run (ctrl-enter) |
Progress graphs:
Your progress graph for this problem
Random user progress graph for this problem
Random Epic Progress Graph
Copyright Nick Parlante 2017 - privacy