Noob Software Engineer vs O(n) Swaggy Engineer on Counting Elements, Leetcode 1426

FAANG Coding Interviews / Data Structures and Algorithms / Leetcode

[GregHogg]

Master Data Structures & Algorithms For FREE at AlgoMap.io!

[jameslockwood]

Absolutely love these clips. keep em coming

[nar]

...
I'm solving LeetCode with C
Each time one of these coding bros pulls out the hashSet/hashMap I get an existential crisis
(because I have to make one myself... oof)
(sometimes you can cheese it by just making the array large enough, based on the upper/lower bounds provided by the problem desc, then it gets easier and the hashFunction can remain simple.)

[imnotaburrito]

Thank god i saw your video right now... Had almost forgotten about my streak today 😭

[beransantur]

Using that solution you are ignoring duplicate values, am I wrong?

[shahbazsingh]

s = set(arr) is O(n) in itself. I think there is no overall change as you are doing the hard work before the loop. Tell me if this isn't the case.

[moviestownhd]

Kabhi kabhi lagta h, ki coding karte karte kahi me bhi iske jaisa na ho jau😢😢

[shiro_asa]

wtf was that, yeah, I need to relearn data structure

[the.comedypie]

But space complexity got increased from O(1) to O(N)

[rishabhshukla]

It seems like there's a glitch on leetcode, Even if you resubmit the same solution it somehow improves the code's runtime!!

[ערןאוצפ]

What platform do you solve these questions on ?

[aashishnegi]

I ve got a better approach

for i in range(len(array)):
if array[0] + i !=array[i]:
return False
return True

[malou]

for the first time, I took a glance at the actual video of you "talking". never again.

[thegamingflow]

Why don't you use some low-level like C language?

[alxjones]

I would put the list into a Counter, then sum over the counts for values whose successor is present.

counter = Counter(arr)
return sum(count for (value, count) in counter.items() if value + 1 in counter)

[marcialabrahantes]

is his mouth even moving or is this a full voiceover lol