Problemcore
Lower bound query
Also called bisect left, first element not less than a key.
Return the first position in a sorted array whose value is not less than the key.
Return the first position in a sorted array whose value is not less than the key.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag YK71ZH Edit this page History Report an error