Problemcore
Rank and select problem
Also called rank and select queries.
Given a bit vector, return the number of 1s up to a position (rank) or the position of the i-th 1 (select).
Given a bit vector, return the number of 1s up to a position (rank) or the position of the i-th 1 (select).
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 9RNDV7 Edit this page History Report an error