From 96c63d335550cf64a81a53e444e6bb61045c39cc Mon Sep 17 00:00:00 2001
From: AshwinSri23 <60453772+AshwinSri23@users.noreply.github.com>
Date: Sat, 21 Oct 2023 15:40:52 +0000
Subject: [PATCH 1/2] Added the Smallest-Sum problem

---
 questions/smallest-sum.md | 19 +++++++++++++++++++
 1 file changed, 19 insertions(+)
 create mode 100644 questions/smallest-sum.md

diff --git a/questions/smallest-sum.md b/questions/smallest-sum.md
new file mode 100644
index 0000000..c6a9ff4
--- /dev/null
+++ b/questions/smallest-sum.md
@@ -0,0 +1,19 @@
+# Smallest Sum
+
+## Question
+
+Here is the problem statement:
+
+Given a list of integers, you will need to find sum that can be created for a given list. For example, if the list was [1,6,9,4,3], the smallest sum of the list would be 4(3+1). Below is a way that you could go about finding smallest sum in an array:
+
+    
+    for(i in range(0,array.length)){
+        for(j in range(0,array.length)){
+            if((array[i]+array[j])<minSum){
+                minSum = (array[i]+array[j])
+            }
+        }
+
+    }
+
+Create a solution to solving this problem efficiently.
\ No newline at end of file

From 964ef4e171757044675d79d7aab966c708b137ed Mon Sep 17 00:00:00 2001
From: AshwinSri23 <60453772+AshwinSri23@users.noreply.github.com>
Date: Sat, 21 Oct 2023 15:44:04 +0000
Subject: [PATCH 2/2] Added smallest-sum question

---
 questions/smallest-sum.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/questions/smallest-sum.md b/questions/smallest-sum.md
index c6a9ff4..65e77c4 100644
--- a/questions/smallest-sum.md
+++ b/questions/smallest-sum.md
@@ -10,7 +10,7 @@ Given a list of integers, you will need to find sum that can be created for a gi
     for(i in range(0,array.length)){
         for(j in range(0,array.length)){
             if((array[i]+array[j])<minSum){
-                minSum = (array[i]+array[j])
+                minSums = (array[i]+array[j])
             }
         }