Longest consecutive subsequence

#1

problem:


I tried the hashmap solution as in video but getting wrong plz tell me corrections in my code
my code >>>>>>>

#2

Hey @coderajay03 i have seen your code and it seems absolutely correct to me, have you seen what test case is it failing? when you will have multiple same elements. Try running test case for them it might get accepted as the logic you have used is absolutely fine.
Input: [4,0,-4,-2,2,5,2,0,-8,-8,-8,-8,-1,7,4,5,5,-4,6,6,-3]
Output: 7
Expected: 5
Or you can also implement in this way if you didn’t find your mistake:

#3

can u plz correct that mistake in my code only please.

#4

Actually I haven’t understood your code that’s why i given a submission for reference. You can correct from it. If you still want correction in your code then do post a thread for the same so that someone might help you in this question.

#5

OKAY I WILL ASK SOMEBODY ELSE THANKYOU!! :slight_smile:

#6

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.