🔒 Harmonious Subsequence

[foggy hornet]

We define a harmonious array as an array where the difference between its maximum value and its minimum value is exactly 1.

Given an integer array nums, return the length of its longest harmonious subsequence among all its possible subsequences.
Example 1:
Input: nums = [1,3,2,2,5,2,3,7]
Output: 5
Explanation:
The longest harmonious subsequence is [3,2,2,2,3].
Example 2:
Input: nums = [1,2,3,4]
Output: 2
Explanation:
The longest harmonious subsequences are [1,2], [2,3], and [3,4], all of which have a length of 2.

Example 3:
Input: nums = [1,1,1,1]
Output: 0

[obtuse crypt]

@foggy hornet

Python help channel opened

Remember to:

• Ask your Python question, not if you can ask or if there's an expert who can help.
• Show a code sample as text (rather than a screenshot) and the error message, if you've got one.
• Explain what you expect to happen and what actually happens.

:warning: Do not pip install anything that isn't related to your question, especially if asked to over DMs.

Closes after a period of inactivity, or when you send !close.

[foggy hornet]

My code:

longest = []
        d = []
        prev = 0

        while prev < len(nums):
            for j in range(len(nums)):
                if nums[j] - nums[prev] == 1:
                    d = nums[prev:j]
                    if len(d) > len(longest):
                        longest =d
            prev += 1
        return len(longest) ```

Why is it failing test case 2?

[austere trench]

I can help if you don't mind,you can kindly inbox me I can be of help

[foggy hornet]

Sure

[fathom spear]

Be careful getting help in DMs. Others can't verify what they're saying.

[craggy siren]

What condition does it have to satisfy? The first example it's not continuous

Or just any valid sequence in any order

[steel yarrow]

Please don't try to redirect help to DMs. Just help people in the thread.

[craggy siren]

He done it 3 in a row in about 2 mins, idk what he's trying

[steel yarrow]

We'll handle it. Please dedicate the rest of this thread to helping OP.

[craggy siren]

yep, I will, if the op still here, I am like 1h after the original post tho, I am gonna hope he is still here

[foggy hornet]

Yeah i am here

Sorry, i was solving this problem

I realized my approach was incorrect

[foggy hornet]

Difference between maximum and minimum value should be equal to 1 and you need to find the biggest possible length of this subsequence

I used to sliding window + hash map to solve it, opposed to just sliding window as i did at the beginning

This is actually my first day of learning "sliding window" concept

So my first solution was far from correct

[craggy siren]

But sliding window wont work for first one

Since it isn't calculate a continuous sequence

There are a 5 in the middle

[foggy hornet]

Are you talking about my code or new one i posted now?

New passed the test cases

[craggy siren]

I mean the proposed case on the top message

[foggy hornet]

It works

My output is 5

[craggy siren]

Oh, sliding window of this
That's why

You can use sorted to make it easier potentially

[foggy hornet]

Is there a way to do it with hash map combined?

[craggy siren]

Well, you don't need hashmap if you sorted it
But idk if it would be faster

[foggy hornet]

Gotcha

Thanks

[obtuse crypt]

Python help channel closed for inactivity

This help channel has been closed. Feel free to create a new post in #1035199133436354600. To maximize your chances of getting a response, check out this guide on asking good questions.