444. Sequence Reconstruction

Practice Sequence Reconstruction for free on NudgeCode: Medium, Graph pattern. Write it in Python or JavaScript, run the tests in your browser, and ask for a hint when you are stuck.

nums is a permutation of 1 .. n. Each sequences[i] is a subsequence of nums. A supersequence contains every sequences[i] as a subsequence.

Return true if nums is the only shortest supersequence of sequences, otherwise false.

Example

nums = [1,2,3], sequences = [[1,2],[1,3]]          ->  false   ([1,3,2] also works)
nums = [1,2,3], sequences = [[1,2],[1,3],[2,3]]    ->  true
nums = [1,2,3], sequences = [[1,2]]                ->  false   ([1,2] is shorter)

Constraints

• 1 <= n <= 10^4; nums is a permutation of 1 .. n
• 1 <= sequences.length <= 10^4, total length of all sequences <= 10^5
• Every sequences[i] is a subsequence of nums, with distinct values