Antony Kamp

I could implement the Boyer-Moore algorithm and additionally the Rabin-Karp algorithm (in my opinion it's the easiest way to find a substring)

I could implement binary search tree and segment tree.

> Hi @antonykamp could you make sure to update RELEASE.md and CONTRIBUTORS.md as part of this PR? (See #1660 and #1661). I'll take care of it after the "literal-overload-naming"-question is...

Hey, If this issue is still active, It would be a pleasure to help. Each cleaning-process is to be converted into one PR, right? And "text surrounding links" are meta-data...

That means: 1. looking for empty notebooks, 2. making a backlog ticket (in slack or a new issue?), 3. deleting the notebook and any reference with it

Hey, If this is still a requested feature, I would be really happy to work on it too :)

Hey @tBuLi Thanks for your help. I'll look into the _AlmostEqual_-Thig with unittest and pytest. Meanwhile Meanwhile, I still want to convert the remaining tests. So it is possible that...

This feature could be added easily after merging #289, because it adds a [helper function to collect subclasses](https://github.com/antonykamp/symfit/blob/ModifPytest/tests/helper_functions.py) eg. of `ConstrainedMinimizer`. Maybe this module should be moved with a PR...

The test test_constrained/test_constrained_dependent_on_matrixmodel didn't fail because of this PR. If I clone the master branch, the test doesn't work either.

I could compress the fixtures to three: parameters a, b and the result_dict. In this case, all the results would be built in a single fixture, which returns a dict...