Add smallest sum#13
Conversation
| for(i in range(0,array.length)){ | ||
| for(j in range(0,array.length)){ | ||
| if((array[i]+array[j])<minSum){ | ||
| minSums = (array[i]+array[j]) | ||
| } | ||
| } | ||
|
|
||
| } |
There was a problem hiding this comment.
| for(i in range(0,array.length)){ | |
| for(j in range(0,array.length)){ | |
| if((array[i]+array[j])<minSum){ | |
| minSums = (array[i]+array[j]) | |
| } | |
| } | |
| } | |
| ```python | |
| for(i in range(0,array.length)){ | |
| for(j in range(0,array.length)){ | |
| if((array[i]+array[j])<minSum){ | |
| minSums = (array[i]+array[j]) | |
| } | |
| } | |
| } |
There was a problem hiding this comment.
You could use the 3 backticks to format it in a nicer way
|
|
||
| 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: |
There was a problem hiding this comment.
The question is a little bit unclear. Maybe explaining why 4(3+1) is the solution could help!
|
|
||
| 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: |
There was a problem hiding this comment.
cool question! Maybe try making the problem more clear. It could maybe be confusing in the first sentence where it says "you will need to find sum that can be created for a given list." Later in the sentence it is mentioned about smallest sum, maybe try adding that near the beginning to make idea more clear :)
|
I think it would be good to say it is the sum of at least two elements to be more clear about the edge cases. |
6 participants
No description provided.