LC-0594 Easy LeetCode

594. Longest Harmonious Subsequence

Array Hash Table Sliding Window Sorting Counting

Read the full problem statement on LeetCode.

Difficulty: easy Acceptance: 57% Topics: Array, Hash Table, Sliding Window, Sorting, Counting

Reading material

Arrays & Hashing 12 min Sliding Window 11 min Sorting 13 min

Reference solution (spoiler · python)

# Time:  O(n)
# Space: O(n)

import collections


class Solution(object):
    def findLHS(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        lookup = collections.defaultdict(int)
        result = 0
        for num in nums:
            lookup[num] += 1
            for diff in [-1, 1]:
                if (num + diff) in lookup:
                    result = max(result, lookup[num] + lookup[num + diff])
        return result

Solution from kamyu104/LeetCode-Solutions · MIT