Skip to the editor
JSGroundwork
JSGroundwork handwritten · web dev
←Back to Segment & Fenwick trees

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›Segment & Fenwick trees

Range Minimum Query (Segment Tree)

advancedlayer A6 · Segment & Fenwick trees5 tests

Build a SegmentTreeMin class over an array of numbers.

  • new SegmentTreeMin(nums) — builds from a non-empty array
  • update(i, val) — replaces the value at index i
  • rangeMin(l, r) — the smallest value in indices l to r inclusive
  • Both operations must be O(log n)
  • A Fenwick tree does not work here — minimum has no inverse, so you cannot subtract one prefix from another
  • Values may be negative; duplicates are fine

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