LeetCode
Question
#3428 Maximum and Minimum Sums of at Most Size K Subsequences
Question Details
LeetCode #3428: Maximum and Minimum Sums of at Most Size K Subsequences. Difficulty: Medium. Topics: Array, Math, Dynamic Programming, Sorting, Combinatorics. Asked at Amazon in the last 6 months.
Original Source
This is a frequency-tagged signal. The full problem statement lives on the original source.
View original →Topics
Combinatorics
Arrays
Dynamic Programming
Math
Sorting
More from Amazon
Reddit
175 k remote offer or 300 k in Bay Area
Reddit
Done with 3 rounds of On-site Amazon SDE 1 interview , but no communication after that. What to do?
Reddit
Nned direction for future prepration.
Reddit
Have an Amazon. SDE1 interview in 4 days, need tips
Reddit
After many years in the industry, I still struggle with textbook definitions in interviews