1
1
mirror of https://github.com/theoludwig/programming-challenges.git synced 2024-11-09 22:08:58 +01:00

feat(challenges): add is-valid-array-subsequence

This commit is contained in:
Divlo 2022-04-23 21:47:58 +02:00
parent 0df7b6620e
commit c4b0e9e757
No known key found for this signature in database
GPG Key ID: 8F9478F220CE65E9
51 changed files with 125 additions and 1 deletions

View File

@ -55,7 +55,7 @@ See the `test` folder for examples of input/output.
2
```
### Example 1
### Example 2
#### Input

View File

@ -0,0 +1,52 @@
# is-valid-array-subsequence
Created by [@Divlo](https://github.com/Divlo) on 23 April 2022.
## Instructions
Given two non-empty arrays of integers, write a function that determines whether the second array is a subsequence of the first one.
A subsequence of an array is a set of numbers that aren't necessarily adjacent in the array but that are in the same order as they appear in the array. For instance, the numbers `[1, 3, 4]` form a subsequence of the array `[1, 2, 3, 4]`, and so do the numbers `[2, 4]`. Note that a single number in an array and the array itself are both valid subsequences of the array.
### Input
- **Line 1:** `array` Integers separated by spaces
- **Line 2:** `sequence` Integers separated by spaces
### Output
The output should return `true` if the `sequence` is a subsequence of `array` and `false` otherwise.
## Examples
See the `test` folder for examples of input/output.
### Example 1
#### Input
```txt
5 1 22 25 6 -1 8 10
1 6 -1 10
```
#### Output
```txt
true
```
### Example 2
#### Input
```txt
5 1 22 25 6 -1 8 10
5 1 22 25 6 -1 8 10 12
```
#### Output
```txt
false
```

View File

@ -0,0 +1,2 @@
5 1 22 25 6 -1 8 10
1 6 -1 10

View File

@ -0,0 +1 @@
true

View File

@ -0,0 +1,2 @@
5 1 22 25 6 -1 8 10
5 1 22 25 6 -1 8 10 12

View File

@ -0,0 +1 @@
false

View File

@ -0,0 +1,2 @@
5 1 22 25 6 -1 8 10
4 5 1 22 25 6 -1 8 10

View File

@ -0,0 +1 @@
false

View File

@ -0,0 +1,2 @@
5 1 22 25 6 -1 8 10
5 1 22 23 6 -1 8 10

View File

@ -0,0 +1 @@
false

View File

@ -0,0 +1,2 @@
5 1 22 25 6 -1 8 10
5 1 22 22 25 6 -1 8 10

View File

@ -0,0 +1 @@
false

View File

@ -0,0 +1,2 @@
5 1 22 25 6 -1 8 10
5 1 22 22 6 -1 8 10

View File

@ -0,0 +1 @@
false

View File

@ -0,0 +1,2 @@
5 1 22 25 6 -1 8 10
1 6 -1 -1

View File

@ -0,0 +1 @@
false

View File

@ -0,0 +1,2 @@
5 1 22 25 6 -1 8 10
1 6 -1 -1 10

View File

@ -0,0 +1 @@
false

View File

@ -0,0 +1,2 @@
5 1 22 25 6 -1 8 10
1 6 -1 -2

View File

@ -0,0 +1 @@
false

View File

@ -0,0 +1,2 @@
5 1 22 25 6 -1 8 10
26

View File

@ -0,0 +1 @@
false

View File

@ -0,0 +1,2 @@
5 1 22 25 6 -1 8 10
5 1 25 22 6 -1 8 10

View File

@ -0,0 +1 @@
false

View File

@ -0,0 +1,2 @@
5 1 22 25 6 -1 8 10
5 1 22 25 6 -1 8 10

View File

@ -0,0 +1 @@
true

View File

@ -0,0 +1,2 @@
5 1 22 25 6 -1 8 10
5 26 22 8

View File

@ -0,0 +1 @@
false

View File

@ -0,0 +1,2 @@
1 1 6 1
1 1 1 6

View File

@ -0,0 +1 @@
false

View File

@ -0,0 +1,2 @@
5 1 22 25 6 -1 8 10
1 6 -1 10 11 11 11 11

View File

@ -0,0 +1 @@
false

View File

@ -0,0 +1,2 @@
5 1 22 25 6 -1 8 10
5 1 22 25 6 -1 8 10 10

View File

@ -0,0 +1 @@
false

View File

@ -0,0 +1,2 @@
5 1 22 25 6 -1 8 10
1 6 -1 5

View File

@ -0,0 +1 @@
false

View File

@ -0,0 +1,2 @@
5 1 22 25 6 -1 8 10
5 1 22 6 -1 8 10

View File

@ -0,0 +1 @@
true

View File

@ -0,0 +1,2 @@
5 1 22 25 6 -1 8 10
22 25 6

View File

@ -0,0 +1 @@
true

View File

@ -0,0 +1,2 @@
5 1 22 25 6 -1 8 10
1 6 10

View File

@ -0,0 +1 @@
true

View File

@ -0,0 +1,2 @@
5 1 22 25 6 -1 8 10
5 1 22 10

View File

@ -0,0 +1 @@
true

View File

@ -0,0 +1,2 @@
5 1 22 25 6 -1 8 10
5 -1 8 10

View File

@ -0,0 +1 @@
true

View File

@ -0,0 +1,2 @@
5 1 22 25 6 -1 8 10
25

View File

@ -0,0 +1 @@
true

View File

@ -0,0 +1,2 @@
1 1 1 1 1
1 1 1

View File

@ -0,0 +1 @@
true