Learn
Practice
Interview
Resources
Newsletter
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
Create Maximum Number
Bookmark
Brute Force
Greedy Decomposition
Input
Input 1
Input 2
Input 3
Custom
nums1
=
[3, 4, 6, 5]
,
nums2
=
[9, 1, 2, 5, 8, 3]
,
k
=
5
nums1
3
4
6
5
nums2
9
1
2
5
8
3
merged
best
(none yet)
nums1
3
4
6
5
nums2
9
1
2
5
8
3
merged
best
(none yet)
pair #26: take 1 from nums1, 4 from nums2
nums1
3
4
6
5
nums2
9
1
2
5
8
3
merged
9
4
1
5
3
best
9
5
8
3
3
not larger, keep the best
pair #55: take 1 from nums1, 4 from nums2
nums1
3
4
6
5
nums2
9
1
2
5
8
3
merged
9
5
1
5
8
best
9
6
5
8
3
not larger, keep the best
pair #82: take 2 from nums1, 3 from nums2
nums1
3
4
6
5
nums2
9
1
2
5
8
3
merged
3
4
1
8
3
best
9
8
3
4
3
not larger, keep the best
pair #111: take 2 from nums1, 3 from nums2
nums1
3
4
6
5
nums2
9
1
2
5
8
3
merged
9
3
5
2
5
best
9
8
3
6
3
not larger, keep the best
pair #140: take 2 from nums1, 3 from nums2
nums1
3
4
6
5
nums2
9
1
2
5
8
3
merged
4
6
1
5
8
best
9
8
4
6
3
not larger, keep the best
pair #169: take 2 from nums1, 3 from nums2
nums1
3
4
6
5
nums2
9
1
2
5
8
3
merged
9
6
5
1
8
best
9
8
4
6
3
not larger, keep the best
pair #196: take 3 from nums1, 2 from nums2
nums1
3
4
6
5
nums2
9
1
2
5
8
3
merged
3
4
6
2
5
best
9
8
6
5
3
not larger, keep the best
pair #225: take 3 from nums1, 2 from nums2
nums1
3
4
6
5
nums2
9
1
2
5
8
3
merged
3
6
5
1
3
best
9
8
6
5
3
not larger, keep the best
winning subsequences
nums1
3
4
6
5
nums2
9
1
2
5
8
3
merged
answer
9
8
6
5
3
maximum =
[9, 8, 6, 5, 3]
algo
master
.
io
Step:
Brute force: merge every subsequence of nums1 with every subsequence of nums2.
0 / 259
Input
Input 1
Input 2
Input 3
Custom
nums1
=
[3, 4, 6, 5]
,
nums2
=
[9, 1, 2, 5, 8, 3]
,
k
=
5
0 / 259
algo
master
.
io
Step:
Brute force: merge every subsequence of nums1 with every subsequence of nums2.
