← Google questions
CodingReported in a candidate post, Oct 2023

Take-or-skip array optimization solved down to O(n)

Filed under Google

The question

The interviewer pasted a problem statement with no test cases, so the candidate had to read it, build test cases and clarify doubts. It looked like a knapsack-style take-or-skip choice over an array to maximize a result; the candidate says it resembles Sliding Window Maximum and Constrained Subsequence Sum.

No write-up yet. Related questions below have one.

Related Google questions

Collected from public candidate posts and coding forums. Updated Nov 2026.