Practice Mode • Dynamic Programming • easy

Capacity Growth Sequence

100 points

Find the longest strictly increasing capacity subsequence.

Problem

You are implementing find the longest strictly increasing capacity subsequence. The input is one JSON value. Return exactly the JSON or scalar result described by the examples, with stable ordering and no extra logging. Return the length of the longest strictly increasing subsequence. Explain your reasoning and complexity during interview review; the judge evaluates only the returned result.

Input contract

One UTF-8 JSON value matching the structures shown in the examples.

Output contract

One deterministic JSON value or scalar with no explanatory text.

Target complexity

O(n log n) time, O(n) space

Judge protocol

function-stdin-json-v1

Examples

Example 1

Input: {"values":[10,9,2,5,3,7,101,20]}
Output: 4

This example demonstrates the core dynamic programming invariant.

Example 2

Input: {"values":[]}
Output: 0

This example covers the empty or minimum boundary.

Constraints

Input is valid UTF-8 JSON and is at most 64 KB.
Output must be deterministic for identical input.
Do not use network access, persistent filesystem writes, subprocesses, or environment secrets.
Handle the empty or minimum boundary shown in the examples.

Progressive hints

Integrity: hidden tests, editorial solutions, and assessment-only cases are never sent to the browser as answer keys. Final execution occurs only in the separately isolated runner.

Execution unavailable until runner deployment and certificationdisabled • pending

Sign in to code

You can review the complete problem publicly. Sign in to save encrypted drafts and submit to the isolated runner.