Link of Similar Question

There is no usable problem statement in this record, so a strong response is not to hallucinate a solution. Ask for the exact input/output, constraints, examples, and whether the linked question is the intended one. Once supplied, restate the task in your own words and establish a correct brute-force baseline. Use the constraints to rule out expensive approaches and look for the appropriate structure: order, prefix state, graph connectivity, dynamic programming state, or a monotonic predicate. Before coding, name the invariant or recurrence that proves the faster method correct and walk it through a minimal example. Explicitly test boundaries such as empty input if allowed, one item, duplicates, negative values, and maximum sizes. Complexity is only meaningful after the contract is known, so report both time and memory from the confirmed input limits. This is more useful to an interviewer than confidently solving an imagined question.