Update searches/binary_search.py

Co-authored-by: Copilot <175728472+Copilot@users.noreply.github.com>

Author: shuhao-alan-fan

searches/binary_search.py

@@ -252,7 +252,7 @@ def binary_search_with_duplicates(sorted_collection: list[int], item: int) -> li
 
     The collection must be sorted in ascending order; otherwise the result will be
     unpredictable. If the target appears multiple times, this function returns a
-    list of **all** indexes where the target occurs. If the target is not found,
+    list of all indexes where the target occurs. If the target is not found,
     it returns an empty list.
 
     :param sorted_collection: some ascending sorted collection with comparable items