← CodeNation questions

O(1) Lower Bound Query on Structure with Three Integers

Filed under CodeNation

The question

Design a data structure holding triplets of integers that supports querying a combined lower bound in O(1) time, updating the values by subtraction, and reinserting the modified structure.

No write-up yet. Related questions below have one.

Related CodeNation questions

Collected from public candidate posts and coding forums. Updated Nov 2026.