Bruno BELANYI
08f2364c50
From what I could find, the rules of the assignment seem to be: 1. Restrict oneself to at most *one* O(log(N)) call, and otherwise use constant time operations on the map. 2. Don't use more operations than strictly necessary on `K` and `V`. 3. Prefer simplicity to performance. I think my solution would fare well under those constraints. |
||
---|---|---|
.woodpecker | ||
src | ||
tests | ||
.clang-format | ||
.envrc | ||
.gitignore | ||
flake.lock | ||
flake.nix | ||
meson.build |