diff --git a/divide_and_conquer/max_difference_pair.py b/divide_and_conquer/max_difference_pair.py
index ba7203595..ffc4b76a7 100644
--- a/divide_and_conquer/max_difference_pair.py
+++ b/divide_and_conquer/max_difference_pair.py
@@ -1,7 +1,4 @@
-from typing import List, Tuple
-
-
-def max_difference(a: List[int]) -> Tuple[int, int]:
+def max_difference(a: list[int]) -> tuple[int, int]:
     """
     We are given an array A[1..n] of integers, n >= 1. We want to
     find a pair of indices (i, j) such that
diff --git a/quantum/ripple_adder_classic.py b/quantum/ripple_adder_classic.py
index d54f67ad6..dc0c2103b 100644
--- a/quantum/ripple_adder_classic.py
+++ b/quantum/ripple_adder_classic.py
@@ -2,13 +2,11 @@
 # https://en.wikipedia.org/wiki/Adder_(electronics)#Full_adder
 # https://en.wikipedia.org/wiki/Controlled_NOT_gate
 
-from typing import Tuple
-
 from qiskit import Aer, QuantumCircuit, execute
 from qiskit.providers import BaseBackend
 
 
-def store_two_classics(val1: int, val2: int) -> Tuple[QuantumCircuit, str, str]:
+def store_two_classics(val1: int, val2: int) -> tuple[QuantumCircuit, str, str]:
     """
     Generates a Quantum Circuit which stores two classical integers
     Returns the circuit and binary representation of the integers