To the Top
File:  root - text - article - 2020 - 01 - longest-consecutive-sequence.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 252 Views, 22666 Search Bots | 69 Words

Subscribe to Feed Burner | Browse | Archive
Hi, here's your problem today. This problem was recently asked by Amazon:

You are given an array of integers. Return the length of the longest consecutive elements sequence in the array.

For example, the input array [100, 4, 200, 1, 3, 2] has the longest consecutive sequence 1, 2, 3, 4, and thus, you should return its length, 4.


def longest_consecutive(nums):
# Fill this in.

print longest_consecutive([100, 4, 200, 1, 3, 2])
# 4


Can you do this in linear time?
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Cateogry: Computing | 252 Views, 22666 Search Bots | 69 Words Subscribe to Feed Burner

Related Articles

  1. Daily Interview Problem: 3 Sum
  2. Making a Height Balanced Binary Search Tree
  3. Daily Interview Problem: Buddy Strings
  4. Daily Interview Problem: Group Words that are Anagrams
  5. Multitasking
  6. Daily Interview Problem: Deepest Node in a Binary Tree
  7. Daily Interview Problem: Min Stack
  8. First and Last Indices of an Element in a Sorted Array
  9. Algorithm Interview: Convert Roman Numerals to Decimal
  10. YES!!

Comments (0)

    Be the first one to comment this page !


Page Edited: May 11 2024 14:36:49 | RSS Subscription
How to Cook a Perfect Steak? | <meta name="robots" content="noindex, follow" />