Skip to the editor
JSGroundwork
JSGroundwork handwritten · web dev
←Back to Heaps & priority queues

Ready to read

JSJavaScript⑂Git◎Interview prepΣDSA in JSSDSystem Design
More topics15›
</>HTML{ }CSS⚛ReactNNext.jsNeNest.jsTSTypeScriptNoNode.js🐳DockerDBSQL & Databases✓Testing🔒Web Security☁Cloud & DevOps◈GraphQL◆Redis☸Kubernetes
☰‹›
Description
All topics›JavaScript›Heaps & priority queues

Last Stone Weight

beginnerlayer I3 · Heaps & priority queues5 tests

You have a pile of stones with the given weights. Repeatedly take the two heaviest stones and smash them together:

  • If they weigh the same, both are destroyed
  • Otherwise the lighter one is destroyed and the heavier one is left with the difference in weight
  • Return the weight of the last remaining stone, or 0 if none remain
  • A MinHeap class is already written for you in the starter — you only need the algorithm

Stuck?

All exercisesPlayground
1234567891011121314
loading the editor…

Nothing yet — hit Run and whatever you log shows up here.

Submit to see how you did.

⌘/Ctrl + Enter run⌘/Ctrl + S save⌘/Ctrl + / comment⌘/Ctrl + F find/replace⌘/Ctrl + D select next matchAlt + click multi-cursorTab indent · ⇧Tab outdentEsc leave fullscreen