Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit ae1d69e

Browse files
p187
1 parent 0fd1800 commit ae1d69e

File tree

1 file changed

+1
-1
lines changed

1 file changed

+1
-1
lines changed

‎AllQuestions.md‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2956,7 +2956,7 @@ the difference between the sum of the subsets is as small as possible.
29562956
For example, given [5, 10, 15, 20, 25], return the sets {10, 25} and {5, 15, 20}
29572957
, which has a difference of 5, which is the smallest possible difference.
29582958

2959-
## Problem-187:waxing_crescent_moon:
2959+
## Problem-187:new_moon:
29602960

29612961

29622962
> This problem was asked by Google.

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /