From 5d3dc86ec7d291855fdd895088b4ac0285c92adc Mon Sep 17 00:00:00 2001 From: Yudhvir Singh Date: Sun, 16 Jun 2024 17:40:14 -0700 Subject: [PATCH] problem 128, 2nd solution --- python/problem_128/solution2.py | 22 ++++++++++++++++++++++ 1 file changed, 22 insertions(+) create mode 100644 python/problem_128/solution2.py diff --git a/python/problem_128/solution2.py b/python/problem_128/solution2.py new file mode 100644 index 0000000..5451e3d --- /dev/null +++ b/python/problem_128/solution2.py @@ -0,0 +1,22 @@ +from typing import List + +class Solution: + def longestConsecutive(self, nums: List[int]) -> int: + # you make set + nums = set(nums) + + longest = 0 + + for i in nums: + # check if n - 1 exists + if i - 1 not in nums: + temp_longest = 1 + start = i + + # now check if we have items in order in set + while start + 1 in nums: + temp_longest += 1 + start += 1 + + longest = max(longest, temp_longest) + return longest