#3428Medium~35 min

Maximum and Minimum Sums of at Most Size K Subsequences

Time O(nlogn) · Space O(n) · Official statement on LeetCode

Solutions

// Time:  O(nlogn)
// Space: O(n)

// sort, combinatorics, two pointers, sliding window
static const uint32_t MOD = 1e9 + 7;

uint32_t addmod(uint32_t a, uint32_t b) {  // avoid overflow
    if (MOD - a <= b) {
        b -= MOD;  // relied on unsigned integer overflow in order to give the expected results
    }
    return a + b;
}

uint32_t submod(uint32_t a, uint32_t b) {
    return addmod(a, (MOD - b) % MOD);
}

// reference: https://stackoverflow.com/questions/12168348/ways-to-do-modulo-multiplication-with-primitive-types
uint32_t mulmod(uint32_t a, uint32_t b)  {  // avoid overflow
    uint32_t result = 0;
    if (a < b) {
        swap(a, b);
    }
    while (b > 0)  { 
        if (b & 1) {
            result = addmod(result, a);
        }
        a = addmod(a, a);
        b >>= 1;
    } 
    return result; 
} 

vector<int> FACT = {1, 1};
vector<int> INV = {1, 1};
vector<int> INV_FACT = {1, 1};
int nCr(int n, int k) {
    if (n < k) {
        return 0;
    }
    while (size(INV) <= n) {  // lazy initialization
        FACT.emplace_back(mulmod(FACT.back(), size(INV)));
        INV.emplace_back(mulmod(INV[MOD % size(INV)], MOD - MOD / size(INV)));  // https://cp-algorithms.com/algebra/module-inverse.html
        INV_FACT.emplace_back(mulmod(INV_FACT.back(), INV.back()));
    }
    return mulmod(mulmod(FACT[n], INV_FACT[n - k]), INV_FACT[k]);
}

class Solution {
public:
    int minMaxSums(vector<int>& nums, int k) {
        sort(begin(nums), end(nums));
        int result = 0;
        for (int i = 0, cnt = 1; i < size(nums); ++i) {
            result = addmod(result, mulmod(addmod(nums[i], nums[size(nums) - 1 - i]), cnt));
            cnt = submod(mulmod(cnt, 2), nCr(i, k - 1));
        }
        return result;
    }
};

// Time:  O(nlogn + n * k)
// Space: O(n)
// combinatorics
class Solution2 {
public:
    int minMaxSums(vector<int>& nums, int k) {
        sort(begin(nums), end(nums));
        int result = 0;
        for (int i = 0; i < size(nums); ++i) {
            int cnt = 0;
            for (int j = 0; j <= min(i, k - 1); ++j) {
                cnt = addmod(cnt, nCr(i, j));
            }
            result = addmod(result, mulmod(addmod(nums[i], nums[size(nums) - 1 - i]), cnt));
        }
        return result;
    }
};

Beginner Explanation

What is Maximum and Minimum Sums of at Most Size K Subsequences?

Maximum and Minimum Sums of at Most Size K Subsequences (LeetCode #3428) is a Medium problem that primarily trains math.

How to think about it

Restate the goal in your own words before coding.
Work a tiny example by hand so the invariant becomes obvious.
Identify the pattern — this problem aligns with sort, two pointers, and sliding window.
Only then translate the idea into code.

Why this problem matters

It sits in the sweet spot of interview difficulty: multiple valid approaches, clear trade-offs. Official solution notes mention: Sort, Combinatorics, Two Pointers, Sliding Window.

AlgoForge explanations are original teaching notes. Always open the official problem statement on LeetCode for constraints and examples.

Interview Walkthrough

Interview approach for Maximum and Minimum Sums of at Most Size K Subsequences

Opening (30–60 seconds)

Clarify inputs/outputs and edge cases (empty input, single element, duplicates, overflow).
State a brute force so the interviewer knows you can solve it naively.
Propose the optimal direction tied to sort, two pointers, and sliding window.

Core solution narrative

Define the state you track (pointers, DP cell, set membership, stack top, etc.).
Explain the transition when you process the next element.
Call out time (O(nlogn)) and space (O(n)) before coding.
Code cleanly; narrate variable names.

What interviewers listen for

Correctness on edge cases
Complexity honesty
Ability to discuss trade-offs (e.g., hash map space vs. sort + two pointers)

Follow-up questions they may ask

Can you solve it with less memory?
What if the input stream is infinite / doesn't fit in RAM?
How would tests look for adversarial inputs?

Optimized Approach

Optimized solution notes

The reference solutions on AlgoForge target O(nlogn) time and O(n) space.

Pattern focus: sort, two pointers, and sliding window

Use the pattern as a checklist:

sort — confirm the invariant holds after each step
two pointers — confirm the invariant holds after each step
sliding window — confirm the invariant holds after each step

Multiple methods appear in the source solutions — compare them and explain when each is preferable.

Implementation tips

Prefer readable names over micro-optimizations in interviews.
Extract helpers only when they clarify (e.g., expand-around-center, DFS visit).
After AC-level logic, re-scan for off-by-one and null checks.

Complexity Analysis

Complexity

Measure	Bound
Time	O(nlogn)
Space	O(n)

How to justify this in an interview

Time: count loops, map/set operations, and recursive branching; state average vs worst case if relevant.
Space: include hash maps, recursion stack, and output allocation when the problem asks for it.

If your implementation differs from the reference, re-derive big-O from your code — never memorize a complexity you cannot defend.

Common Mistakes

Common mistakes on Maximum and Minimum Sums of at Most Size K Subsequences

Skipping edge cases — empty collections, single-element inputs, max constraints.
Wrong invariant for sort, two pointers, and sliding window — updating state too early or too late.
Mutating input unexpectedly when the problem forbids it.
Off-by-one in windows, ranges, or binary search bounds.
Ignoring overflow / precision for integer arithmetic problems.
Overengineering — jumping to an advanced structure when a simpler approach works.

Alternative Approaches

Alternatives

The source file includes more than one method. Compare:

Primary optimized path — best complexity for typical interviews.
Secondary approach — often brute force, sorting-based, or space-optimized variant.

Practice articulating when you would pick each (constraints, readability, follow-ups).

Edge Cases

Edge cases checklist

Minimum input size
Maximum input size / time limits
Duplicates and already-sorted input
Negative numbers / zeros (if applicable)
Disconnected structures (graphs/trees)
Single path vs branching recursion depth

Pattern Recognition

Spotting this pattern

Signal phrases that point to sort, two pointers, and sliding window:

Sorted input or ability to sort without changing the answer class
Need for contiguous subarray / substring → consider sliding window
Need for O(1) membership → hash set/map
Optimal substructure + overlapping subproblems → DP
Connectivity / components → graph DFS/BFS or Union-Find

Primary topics: math.

Follow-up Interview Questions

Follow-ups

How does the solution change if the input is a stream?
Can you solve it in-place?
What if duplicates must be handled differently?
How would you parallelize the approach?
Design tests that would break a buggy implementation.

Practice Recommendations

What to practice next

Re-solve Maximum and Minimum Sums of at Most Size K Subsequences in a second language (cpp, python).
Drill 3–5 more problems tagged math.
Teach the solution out loud in under 5 minutes.
Add this problem to your revision calendar in 3 days and 14 days.

Visualization

Conceptual diagram for Maximum and Minimum Sums of at Most Size K Subsequences: show input structure (math), highlight the moving parts of the sort, two pointers, and sliding window approach, and annotate each step with the maintained invariant and complexity.

Study checklist

Read the official problem statement on LeetCode
Solve on paper / whiteboard first
Implement the sort, two pointers, and sliding window approach
Verify edge cases from the checklist
State time and space complexity aloud
Compare with the AlgoForge reference solution
Schedule a revision session

Revision notes

Maximum and Minimum Sums of at Most Size K Subsequences (#3428) — Medium. Pattern: sort, two pointers, and sliding window. Complexity: O(nlogn) time / O(n) space. Re-derive the invariant before coding.

FAQs

What is the time complexity of Maximum and Minimum Sums of at Most Size K Subsequences?+

The reference solutions aim for O(nlogn) time and O(n) space. Always re-derive complexity from the code you write in the interview.

What pattern does Maximum and Minimum Sums of at Most Size K Subsequences use?+

It primarily maps to sort, two pointers, and sliding window, within the broader topic of math.

Is Maximum and Minimum Sums of at Most Size K Subsequences good for interviews?+

Yes — as a Medium problem it is a solid practice target. Pair it with related problems in the same pattern family for spaced repetition.

Where can I read the official statement?+

Open the official LeetCode page for constraints and examples: https://leetcode.com/problems/maximum-and-minimum-sums-of-at-most-size-k-subsequences/

#	Title	Difficulty	Topics
2171	Removing Minimum Number of Magic Beans	Medium	math
2280	Minimum Lines to Represent a Line Chart	Medium	math
2731	Movement of Robots	Medium	math
2779	Maximum Beauty of an Array After Applying Operation	Medium	two pointers
2933	High-Access Employees	Medium	two pointers
3346	Maximum Frequency of an Element After Performing Operations I	Medium	two pointers
3413	Maximum Coins From K Consecutive Bags	Medium	two pointers
3634	Minimum Removals to Balance Array	Medium	two pointers