From 540339e935e048bd53918cd80227624a7b2096db Mon Sep 17 00:00:00 2001
From: Danujaya  Liyanage <2021is054@stu.ucsc.cmb.ac.lk>
Date: Sat, 7 Oct 2023 08:02:30 +0530
Subject: [PATCH 1/3] add doctests to dynamic_programming/minimum_partition.py

---
 dynamic_programming/minimum_partition.py | 22 ++++++++++++++++++++++
 1 file changed, 22 insertions(+)

diff --git a/dynamic_programming/minimum_partition.py b/dynamic_programming/minimum_partition.py
index 3daa9767fde4..25b3c9c3acf6 100644
--- a/dynamic_programming/minimum_partition.py
+++ b/dynamic_programming/minimum_partition.py
@@ -4,6 +4,28 @@
 
 
 def find_min(arr):
+    """
+    Partition a set into two subsets such that the difference of subset sums is minimum.
+
+    Examples:
+    >>> find_min([1, 6, 11, 5])
+    1
+
+    >>> find_min([3, 1, 4, 2, 2])
+    0
+
+    >>> find_min([1, 2, 3, 4, 5])
+    1
+
+    >>> find_min([1, 2, 7])
+    4
+
+    >>> find_min([10, 5, 3, 7, 2, 8])
+    1
+
+    >>> find_min([4, 2, 8, 6])
+    0
+    """
     n = len(arr)
     s = sum(arr)
 

From 04c6a2686a1878b58ef73e0f00038b364a6b0421 Mon Sep 17 00:00:00 2001
From: Danujaya  Liyanage <2021is054@stu.ucsc.cmb.ac.lk>
Date: Sat, 7 Oct 2023 08:09:38 +0530
Subject: [PATCH 2/3] add doctests to dynamic_programming/minimum_partition.py
 Fixes #99433

---
 dynamic_programming/minimum_partition.py | 2 --
 1 file changed, 2 deletions(-)

diff --git a/dynamic_programming/minimum_partition.py b/dynamic_programming/minimum_partition.py
index 25b3c9c3acf6..5d89af6a8599 100644
--- a/dynamic_programming/minimum_partition.py
+++ b/dynamic_programming/minimum_partition.py
@@ -5,8 +5,6 @@
 
 def find_min(arr):
     """
-    Partition a set into two subsets such that the difference of subset sums is minimum.
-
     Examples:
     >>> find_min([1, 6, 11, 5])
     1

From 566bbf00a908172c04f90aec24098585ca256aaa Mon Sep 17 00:00:00 2001
From: Danujaya  Liyanage <2021is054@stu.ucsc.cmb.ac.lk>
Date: Sat, 7 Oct 2023 08:31:18 +0530
Subject: [PATCH 3/3] fix error in doctest

---
 dynamic_programming/minimum_partition.py | 7 ++-----
 1 file changed, 2 insertions(+), 5 deletions(-)

diff --git a/dynamic_programming/minimum_partition.py b/dynamic_programming/minimum_partition.py
index 5d89af6a8599..a9da56b609a4 100644
--- a/dynamic_programming/minimum_partition.py
+++ b/dynamic_programming/minimum_partition.py
@@ -1,10 +1,7 @@
-"""
-Partition a set into two subsets such that the difference of subset sums is minimum
-"""
-
-
 def find_min(arr):
     """
+    Partition a set into two subsets such that the difference of subset sums is minimum
+
     Examples:
     >>> find_min([1, 6, 11, 5])
     1