Grokking the Coding Interview: Patterns for Coding Questions

Ask Author

Back to course home

0% completed

Problem Challenge 1: Reconstructing a Sequence (hard)

Problem Statement

Given a sequence originalSeq and an array of sequences, write a method to find if originalSeq can be uniquely reconstructed from the array of sequences.

Unique reconstruction means that we need to find if originalSeq is the only sequence such that all sequences in the array are subsequences of it.

Example 1:

Input: originalSeq: [1, 2, 3, 4], seqs: [[1, 2], [2, 3], [3, 4]]
Output: true
Explanation: The sequences [1, 2], [2, 3], and [3, 4] can uniquely reconstruct

.....

.....

.....

Like the course? Get enrolled and start learning!