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

Furthest Building You Can Reach

advancedlayer I3 · Heaps & priority queues5 tests

You walk along a row of buildings with the given heights, starting at index 0 and always moving to the next building. You carry bricks bricks and ladders ladders.

  • Stepping down or onto an equal height is free
  • Stepping up by d costs either d bricks or one ladder
  • A ladder covers any height difference; bricks are consumed permanently
  • Return the index of the furthest building you can reach
  • 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