Solving Longest Harmonious Subsequence in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.

Problem Description

Example 1:

Input: [1,3,2,2,5,2,3,7]
Output: 5
Explanation: The longest harmonious subsequence is [3,2,2,2,3].

See the full details of the problem Longest Harmonious Subsequence at LeetCode

Originally posted at: @github.com/halfrost/LeetCode-Go