diff --git a/dynamic_programming/integer_partition.py b/dynamic_programming/integer_partition.py
index 4eb06348c..8ed2e51bd 100644
--- a/dynamic_programming/integer_partition.py
+++ b/dynamic_programming/integer_partition.py
@@ -6,8 +6,8 @@ into k parts. These two facts together are used for this algorithm.
 """
 
 
-def partition(m):
-    memo = [[0 for _ in range(m)] for _ in range(m + 1)]
+def partition(m: int) -> int:
+    memo: list[list[int]] = [[0 for _ in range(m)] for _ in range(m + 1)]
     for i in range(m + 1):
         memo[i][0] = 1