diff --git a/dynamic_programming/subset_generation.py b/dynamic_programming/subset_generation.py
index f29c509d2..5d4d2792b 100644
--- a/dynamic_programming/subset_generation.py
+++ b/dynamic_programming/subset_generation.py
@@ -1,7 +1,6 @@
 # return all subset combinations of n element in given set of r element.
 
 
-
 def subset_combinations_dp(elements, n):
     r = len(elements)
 
@@ -23,4 +22,4 @@ if __name__ == "__main__":
     elements = [10, 20, 30, 40]
     n = 2
     result = subset_combinations_dp(elements, n)
-    print(result)
\ No newline at end of file
+    print(result)