diff --git a/data_structures/binary_tree/binary_search_tree.py b/data_structures/binary_tree/binary_search_tree.py
index 090e3e25f..32194ddc2 100644
--- a/data_structures/binary_tree/binary_search_tree.py
+++ b/data_structures/binary_tree/binary_search_tree.py
@@ -336,7 +336,7 @@ def inorder(curr_node: Node | None) -> list[Node]:
     """
     node_list = []
     if curr_node is not None:
-        node_list = inorder(curr_node.left) + [curr_node] + inorder(curr_node.right)
+        node_list = [*inorder(curr_node.left), curr_node, *inorder(curr_node.right)]
     return node_list
 
 
diff --git a/dynamic_programming/subset_generation.py b/dynamic_programming/subset_generation.py
index 1be412b93..d490bca73 100644
--- a/dynamic_programming/subset_generation.py
+++ b/dynamic_programming/subset_generation.py
@@ -45,7 +45,7 @@ def subset_combinations(elements: list[int], n: int) -> list:
     for i in range(1, r + 1):
         for j in range(i, 0, -1):
             for prev_combination in dp[j - 1]:
-                dp[j].append(tuple(prev_combination) + (elements[i - 1],))
+                dp[j].append((*prev_combination, elements[i - 1]))
 
     try:
         return sorted(dp[n])
diff --git a/maths/odd_sieve.py b/maths/odd_sieve.py
index 60e92921a..06605ca54 100644
--- a/maths/odd_sieve.py
+++ b/maths/odd_sieve.py
@@ -33,7 +33,7 @@ def odd_sieve(num: int) -> list[int]:
                 0, ceil((num - i_squared) / (i << 1))
             )
 
-    return [2] + list(compress(range(3, num, 2), sieve))
+    return [2, *list(compress(range(3, num, 2), sieve))]
 
 
 if __name__ == "__main__":
diff --git a/pyproject.toml b/pyproject.toml
index 65a0754d6..3a012203a 100644
--- a/pyproject.toml
+++ b/pyproject.toml
@@ -13,7 +13,10 @@ lint.ignore = [    # `ruff rule S101` for a description of that rule
   "PLW2901",  # PLW2901: Redefined loop variable -- FIX ME
   "PT011",    # `pytest.raises(Exception)` is too broad, set the `match` parameter or use a more specific exception
   "PT018",    # Assertion should be broken down into multiple parts
-  "RUF00",    # Ambiguous unicode character and other rules
+  "RUF001",   # String contains ambiguous {}. Did you mean {}?
+  "RUF002",   # Docstring contains ambiguous {}. Did you mean {}?
+  "RUF003",   # Comment contains ambiguous {}. Did you mean {}?
+  "RUF007",   # Prefer itertools.pairwise() over zip() when iterating over successive pairs
   "S101",     # Use of `assert` detected -- DO NOT FIX
   "S113",     # Probable use of requests call without timeout -- FIX ME
   "S311",     # Standard pseudo-random generators are not suitable for cryptographic purposes -- FIX ME