Tap here to switch tabs
Problem
Submissions

Problem: Longest Common Subsequence Between Sorted Arrays

Longest Common Subsequence Between Sorted Arrays gives you multiple strictly increasing integer arrays and asks for the longest sequence of values shared by every array, in increasing order.

Statement

Given a 2D2 D integer array arrays where each subarray arrays[i] is sorted in strictly increasing order, return an array containing the longest common subsequence present across all the given arrays.

The elements in the resulting array must also be in strictly increasing order.

Constraints:

  • 2≤2 \leq arrays.length ≤100\leq 100

  • 1≤1 \leq arrays[i].length ≤100\leq 100

  • 1≤1 \leq arrays[i][j] ≤100\leq 100

  • arrays[i] is sorted in strictly increasing order.

⋮
Tap here to switch tabs
Problem
Submissions

Problem: Longest Common Subsequence Between Sorted Arrays

Longest Common Subsequence Between Sorted Arrays gives you multiple strictly increasing integer arrays and asks for the longest sequence of values shared by every array, in increasing order.

Statement

Given a 2D2 D integer array arrays where each subarray arrays[i] is sorted in strictly increasing order, return an array containing the longest common subsequence present across all the given arrays.

The elements in the resulting array must also be in strictly increasing order.

Constraints:

  • 2≤2 \leq arrays.length ≤100\leq 100

  • 1≤1 \leq arrays[i].length ≤100\leq 100

  • 1≤1 \leq arrays[i][j] ≤100\leq 100

  • arrays[i] is sorted in strictly increasing order.