Noob O(n log n) Developer vs Strong O(n) Programmer in Longest Consecutive Sequence, Leetcode 128

FAANG Coding Interviews / Data Structures and Algorithms / Leetcode

[GregHogg]

Thank you for watching the video! This was shortened to fit in the shorts feed, please click the related video link to see the whole thing (trust me it's worth it!)

[akhilhandoo]

I think your solution takes O(n log n) time due to the sort(). The requirement in question clearly mentions constraint of O(n) time.

[rushikesh]

Cycle sort will give ans in n complexity easily

[at-sushi]

I needed a couple of weeks to understand LCS.

[Saheryk]

I wondered how were you able to solve it in 3 seconds.

[SathvikSagar]

Every time i see i realise i code like a noob programmer 😭😭

[dbarless]

Interview questions like this are stupid, never in my 8 years programming professionally have I ever run into any problem like this leetcode style nonsense

[hlubradio]

Damn dude you make every so simple. I gotta take the time to implement some of these

[guilhermewxs]

Bruh i'd just throw a hashmap on it 😂😂

[Dri]

what us the site of the challenges? leetcode?

[krishwanthkishore]

If this is noob level, then i don't know what level i am 💀

[aakashs]

Does transferring nums into set gives us sorted data with no duplicates? If yes, sorting is not needed, in C++ set always gives values in sorted format

[ImRafaelPL]

well yeah this solution is faster, but on leetcode yours beats only 5% :O