How should I practice Can Subsequences Share One Master Sequence??

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

Is Can Subsequences Share One Master Sequence? associated with Google?

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

Can Subsequences Share One Master Sequence?

Google● MediumNEW GRADONSITE INTERVIEW

Learn

Problem statement

Each row of subsequences lists distinct tokens in the order in which they must appear.

Decide whether there exists one master sequence that contains every distinct token exactly once and has every row as a subsequence.

Return true when such a master sequence exists, otherwise return false. You do not need to construct the master sequence.

Function

canShareMasterSequence(subsequences: String[][]) → boolean

Examples

Example 1

subsequences = [["a","b"],["a","c"]]return = true

Both rows are subsequences of [a,b,c].

Example 2

subsequences = [["a","b"],["b","a"]]return = false

The first row requires a before b, while the second requires the reverse.

Example 3

subsequences = [["a","c"],["a","b","c"],["b","d"]]return = true

[a,b,c,d] respects every reported order constraint.

Constraints

1 <= subsequences.length <= 100000.
Every row contains from 1 through 100000 distinct tokens.
The total number of token occurrences is at most 200000.
Every token is a non-empty lowercase English string of length at most 30.