Longest Consecutive Sequence | LeetCode 128 | C++, Java, Python

[@SonuSharma-fc9hd]

Your teaching style is awesome. I like our voice 😅

[@KnowledgeCenter]

Thanks for the motivating words.

[@prasantharavindramesh1078]

awesome explanation.Just a small clarification.The consecutive sequence can be in any order is true but what if the consecutive sequence has duplicates like for the above example say [100,1,200,1,10,4,0,3,8,2].Here the consecutive sequence is [0,1,1,2,3,4] so i need to store the frequency also correct if input has duplicates?

[@deepanrajusugavasan9762]

superb bro keep uploading⭐

[@KnowledgeCenter]

Thanks.

[@PEEYUSHKUMARPATHAK]

Loved the explanation . Let's say we want to print the LCS, how would we achieve that? Would be interested in the java solution

[@KnowledgeCenter]

Keep 2 more variables: int prev_max, next_max if ((next-prev-1) > res){ prev_max = prev; next_max = next; res = next-prev-1; } Finally print the sequence: prev+1, prev+2, ...., next-1.

[@gokulnaathb2627]

Just beautiful

[@inspired_enough_to_grow_up]

map/ set creation will also take O(n log n) right?

[@gokulnaathb2627]

unordered_map or unordered_set creation will take only o(n) time if we want to insert n elements. map or set will take o(nlong)

[@subee128]

Thanks

[@bestsaurabh]

Instead of unordered_set, we could have used unordered_map with O(1) lookup or it does not matter?

[@navjot7397]

unordered set also has O(1) lookup (average)

[@indiancseresearch6109]

thanks ;

[@KnowledgeCenter]

You're welcome!

[@syedabdul1228]

Arr=[values] Max=0 for i in Arr: Maxlen=1 n=i While n=n+1 in Arr Maxlen+=1 if Max