Largest Subset With Consecutive Numbers

[@IDeserve]

Dear Friends, If you like our content and would like us to continue making great content for you, please spread the word about IDeserve. A share/appreciation from you on social network would mean the world to us! Also, do like our Facebook page: facebook.com/IDeserve.co.in :) Thanks, -Team IDeserve.

[@pawandeepchor89]

Excellent explanation, cannot thank you any more. Cheers !! Keep up the good work buddy !!

[@IDeserve]

Thank you so much for your kind words Praveen!

[@sg1192k]

Shouldn't this be O(n^2) in the worst case? the while loop can take a lot of time if the entire set consists of consecutive numbers

[@SmartProgramming]

awesome sir, easily explained, thanks a lot 👍👍👍👍🙂🙂

[@IDeserve]

Thank you so much for your kind words!

[@lifehacks9450]

U r doing a great job please upload more

[@tanishqsaluja8281]

output is the length instead of being the sub-array,how to print the the sub-array ? Sub-array is updated i.e overwriting previous sub-array once updated?

[@SudeeptaSood]

What is the time complexity and space complexity?

[@syedmushtaq123]

Why not just sort and loop to find consecutive numbers?

[@beyond-convention]

that takes o(nlog n) time complexity. in this method u only take o(n) complexity

[@rahulkmr268]

The only problem is hashing! if the numbers are very large and random then this solution might create issues. Apart from that good Solution.

[@sumanghosh3541]

which is less rajnith logn or n ?

[@lifehacks9450]

Happy New year sirr

[@IDeserve]

Happy New Year 😊