bimap-rs VS Rust

Your requirements may be slightly different, but you could take a look at how e.g. bimap does it.

`multi_index_map` is designed to allow storage and retrieval of data through multiple indexes, along the lines of in-memory relational database. This is useful in a few situations, notably when you want to implement structures like a bi-directional map (ie. searchable either for key or value), or sets with multiple iteration orders. There exist great crates for bi-directional maps already eg. [bimap-rs](https://github.com/billyrieger/bimap-rs/), however MultiIndexMap goes further and removes the distinction between key and value, such that as many keys as necessary can be added and searched for. Multiple iteration orders can be specificed using multiple `ordered_unique` keys, and iterating by these keys. Non-unique keys are also supported, so more than one element can be retrieved from a single lookup. This crate was inspired by [Boost's C++ Multi-Index Containers](https://www.boost.org/doc/libs/1\_80\_0/libs/multi\_index/doc/index.html), but completely redesigned for a more idiomatic Rust API. We've got to v0.4.0 now, and the main features have been fleshed out enough for me to feel comfortable announcing this. There is still lots to do, and I'm welcoming PRs from anyone who wishes to contribute. The [Future Work](https://github.com/lun3x/multi\_index\_map#future-work) section explains the general direction I am planning on going in.

This repo could suit your needs TheAlgorithms

39. The Algorithms Rust git repo offers code examples for many essential standard algorithms for data structures, sorting, and strings, among many others. This is a very good resource if you are trying to practice for job interviews.

Oh, i didn't implement convex hull algorithm. And that was a random file i opened from the Rust-Algorithms repo, I contributed with some algos few months back!

Edit: forgot the link. Here it is https://github.com/TheAlgorithms/Rust

Yeah, I also only looked at one of them (https://github.com/TheAlgorithms/Rust/blob/master/src/string/aho_corasick.rs) and was left with the same impression.

First one I checked was `two_sum.rs` and it uses a `HashMap`: https://github.com/TheAlgorithms/Rust/blob/master/src/genera...

Surely the best way is to sort the numbers and then walk from both ends?

Nice work anyway!