0

help with the code

Two sequences x [1] are given. . x [n] and y [1]. . y [k] of integers. Find out whether the second sequence is a subsequence of the first, that is, whether it is possible to delete some of the terms from the first so that the second term remains.

23rd Nov 2017, 3:44 PM
Nikita
Nikita  - avatar
5 Answers
+ 7
Have you tried doing it yourself yet?
23rd Nov 2017, 3:57 PM
qwerty
qwerty - avatar
+ 7
Then show me your code and specify your problem.
23rd Nov 2017, 4:07 PM
qwerty
qwerty - avatar
+ 3
homework?
23rd Nov 2017, 3:49 PM
Manual
Manual - avatar
+ 1
QWERTY , yea
23rd Nov 2017, 4:02 PM
Nikita
Nikita  - avatar
0
Manual,yes
23rd Nov 2017, 4:02 PM
Nikita
Nikita  - avatar