Codeforces Round 658 (Div. 2)

1 problems from Codeforces Round 658 (Div. 2) (contest 1382), difficulty 800-800. 0/1 solutions verified against sample I/O.

1 items

Codeforces Round 658 (Div. 2)

Div. 2 | 1 problems | 0/1 verified | Difficulty 800-800 | 6m 41s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Common Subsequence	800	brute-force	27,359	6m 41s

Practice › Codeforces Solutions › Codeforces Round 658 (Div. 2) ›

CF 1382A - Common Subsequence

We are given two integer arrays, and we want to construct a third array that can be obtained by deleting elements from both of them. In other words, we are looking for a sequence of values that appears in both arrays while preserving order in each.