Reversed O(n^2) Developer vs Skilled Heap O(n log n) Engineer on Last Stone Weight, Leetcode 1046

preview_player
Показать описание

Please check my playlists for free DSA problem solutions:

Best Courses for Analytics:
---------------------------------------------------------------------------------------------------------

Best Courses for Programming:
---------------------------------------------------------------------------------------------------------

Best Courses for Machine Learning:
---------------------------------------------------------------------------------------------------------

Best Courses for Statistics:
---------------------------------------------------------------------------------------------------------

Best Courses for Big Data:
---------------------------------------------------------------------------------------------------------

More Courses:
---------------------------------------------------------------------------------------------------------

Full Disclosure:
Please note that I may earn a commission for purchases made at the above sites! I strongly believe in the material provided; I only recommend what I truly think is great. If you do choose to make purchases through these links; thank you for supporting the channel, it helps me make more free content like this!
Рекомендации по теме
Комментарии
Автор

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

GregHogg
Автор

Sir your creation of content is very unique... keep doing like this sir

FitLoki
Автор

Data scientists’ stomach built different

lalalander
Автор

Do data scientist/ AI ML Engineer careers need this level of DSA?

keerthidas
Автор

Bro's short videos made me subscribe him.👌

lucifercoxi
Автор

Nice AI used for face cam looks almost real
Or is it a voiceover ?

Masteraffan
Автор

I hate your videos because they remind me that I'm always gonna be a bad developer / software engineer.

RhoMancer
Автор

while len(stones)>1:

x=max(stones)
#print('x', x)
stones.remove(x)

y=max(stones)
#print('y', y)
stones.remove(y)

if x==y:
pass
elif x<y:
y-=x
stones.append(y)
else:
x-=y
stones.append(x)
#print(stones)

if len(stones)==0:
print(0)
else:
print(stones[0])

amangoyal
Автор

Do data scientist/AI ML Engineer career need this level of DSA?

keerthidas