Скачать или смотреть Leetcode Solutions: Problem 1046 - Last Stone Weight

Problem of the day! April 24th, 2023

I forgot to mention for the naive solution, the other O(n^2) solution would be to sort the array and continue maintaining that sorted array instead of finding the maximum every time. While this makes it easier to find the maximum, it is still O(n^2) because if you have to insert a new stone, in the worst case it is O(n) to insert it while maintaining sorted order.

Reference for details on heap data structure (there are multiple types of heaps in computer science):
https://www.geeksforgeeks.org/introduction...

Chapters:
00:00 - Intro to POTD
00:45 - Problem statement
01:33 - Examples
02:57 - Naive solution, O(n^2)
07:12 - Max heap solution, O(nlogn)
11:33 - Outro