How should I practice Decreasing Subsequences?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Google online assessment problems in FastPrep.

Is Decreasing Subsequences associated with Google?

FastPrep tags this as a Google online assessment coding practice problem when the problem catalog has that company and stage context.

Decreasing Subsequences

Google● MediumINTERNNEW GRADOA

Problem statement

Given an int array nums of length n . Split it into strictly decreasing su...

The problem statement continues

Pro

Examples

Example 1

nums = [5, 2, 4, 3, 1, 6]return = 3

You can split this array into: [5, 2, 1], [4, 3], [6]. And there are 3 subsequences you get. Or you can split it into [5, 4, 3], [2, 1], [6]. Also 3 subsequences. But [5, 4, 3, 2, 1], [6] is not legal because [5, 4, 3, 2, 1] is not a subsequence of the original array.

2 original screenshots from the interview report

Pro

FastPrep Pro

Reported in 1 Google interview this week

Unlock this recently reported problem

FastPrep Pro gives you full access to interview problems reported within the last week.

Full problem statement and constraints
2 more worked examples, explained
Guided hints and editorial
Run your code on real test cases

$8.25/month

$99 billed yearly — or $19 month-to-month. Cancel anytime.

Free plan — 2 of 2 free unlocks used this week

See Google hiring insights