question stringlengths 53 2.32k | answer stringlengths 1 5.65k | metadata stringlengths 73 5.85k | dataset_source stringclasses 34
values |
|---|---|---|---|
Your job is to perform max/average pooling on the given matrix.
The stride is equal to the kernel size, meaning there is no overlap between the pooling regions.
Your output should be a matrix in the same format as the input matrix.
The output matrix is smaller than the input matrix when the kernel size is greater than... | 9 | {"source_dataset": "pool_matrix", "source_index": 0, "matrix": [[6, 3], [7, 4], [6, 9]], "pool_type": "max", "pool_size": 3, "solution": [[9]], "rows": 3, "cols": 2, "difficulty": {"rows": [2, 10], "cols": [2, 10], "pool_size": [1, 3]}} | pool_matrix |
Your job is to perform max/average pooling on the given matrix.
The stride is equal to the kernel size, meaning there is no overlap between the pooling regions.
Your output should be a matrix in the same format as the input matrix.
The output matrix is smaller than the input matrix when the kernel size is greater than... | 2.5 2.17 | {"source_dataset": "pool_matrix", "source_index": 1, "matrix": [[4, 0, 1, 5, 0, 3], [1, 2, 7, 0, 3, 2]], "pool_type": "average", "pool_size": 3, "solution": [[2.5, 2.1666666666666665]], "rows": 2, "cols": 6, "difficulty": {"rows": [2, 10], "cols": [2, 10], "pool_size": [1, 3]}} | pool_matrix |
Your job is to perform max/average pooling on the given matrix.
The stride is equal to the kernel size, meaning there is no overlap between the pooling regions.
Your output should be a matrix in the same format as the input matrix.
The output matrix is smaller than the input matrix when the kernel size is greater than... | 4.89 4.0 4.44 7.0
3.67 4.33 5.0 5.67
5.17 2.5 6.5 7.5 | {"source_dataset": "pool_matrix", "source_index": 2, "matrix": [[4, 3, 1, 3, 0, 4, 3, 8, 7, 7], [6, 9, 3, 7, 3, 3, 6, 5, 4, 5], [9, 1, 8, 7, 4, 5, 3, 0, 4, 9], [2, 8, 8, 6, 2, 0, 3, 4, 8, 3], [2, 2, 1, 2, 2, 9, 8, 1, 8, 9], [4, 2, 4, 6, 7, 5, 5, 6, 2, 5], [1, 8, 9, 1, 8, 0, 9, 3, 5, 9], [5, 0, 8, 0, 4, 2, 9, 7, 6, 6]],... | pool_matrix |
Your job is to perform max/average pooling on the given matrix.
The stride is equal to the kernel size, meaning there is no overlap between the pooling regions.
Your output should be a matrix in the same format as the input matrix.
The output matrix is smaller than the input matrix when the kernel size is greater than... | 9 8 9 8
9 8 8 6
9 9 9 9 | {"source_dataset": "pool_matrix", "source_index": 3, "matrix": [[3, 0, 5, 3, 4, 9, 8, 1], [5, 9, 6, 8, 7, 8, 5, 2], [8, 1, 6, 4, 8, 4, 6, 4], [9, 1, 6, 8, 8, 1, 6, 0], [4, 9, 8, 0, 9, 2, 6, 7], [0, 0, 2, 9, 2, 6, 0, 9]], "pool_type": "max", "pool_size": 2, "solution": [[9, 8, 9, 8], [9, 8, 8, 6], [9, 9, 9, 9]], "rows":... | pool_matrix |
Your job is to perform max/average pooling on the given matrix.
The stride is equal to the kernel size, meaning there is no overlap between the pooling regions.
Your output should be a matrix in the same format as the input matrix.
The output matrix is smaller than the input matrix when the kernel size is greater than... | 5.0 8.0 4.0 3.0 2.0 0.0 2.0 8.0
0.0 7.0 6.0 2.0 2.0 2.0 2.0 6.0
7.0 8.0 8.0 6.0 0.0 2.0 4.0 8.0 | {"source_dataset": "pool_matrix", "source_index": 4, "matrix": [[5, 8, 4, 3, 2, 0, 2, 8], [0, 7, 6, 2, 2, 2, 2, 6], [7, 8, 8, 6, 0, 2, 4, 8]], "pool_type": "average", "pool_size": 1, "solution": [[5.0, 8.0, 4.0, 3.0, 2.0, 0.0, 2.0, 8.0], [0.0, 7.0, 6.0, 2.0, 2.0, 2.0, 2.0, 6.0], [7.0, 8.0, 8.0, 6.0, 0.0, 2.0, 4.0, 8.0]... | pool_matrix |
Your job is to perform max/average pooling on the given matrix.
The stride is equal to the kernel size, meaning there is no overlap between the pooling regions.
Your output should be a matrix in the same format as the input matrix.
The output matrix is smaller than the input matrix when the kernel size is greater than... | 8 7
7 1
7 4
9 2 | {"source_dataset": "pool_matrix", "source_index": 5, "matrix": [[7, 6, 7], [8, 8, 3], [0, 7, 0], [7, 7, 1], [7, 2, 2], [1, 7, 4], [8, 9, 2]], "pool_type": "max", "pool_size": 2, "solution": [[8, 7], [7, 1], [7, 4], [9, 2]], "rows": 7, "cols": 3, "difficulty": {"rows": [2, 10], "cols": [2, 10], "pool_size": [1, 3]}} | pool_matrix |
Your job is to perform max/average pooling on the given matrix.
The stride is equal to the kernel size, meaning there is no overlap between the pooling regions.
Your output should be a matrix in the same format as the input matrix.
The output matrix is smaller than the input matrix when the kernel size is greater than... | 0 3 1 4 0 0 6
6 2 0 6 6 0 7
8 2 2 5 2 5 9
2 6 2 1 5 6 0
5 2 6 6 5 6 2
2 5 4 7 3 2 0
3 3 6 0 2 1 6
9 3 9 1 7 4 2
1 6 3 5 0 7 4
2 1 9 3 0 3 0 | {"source_dataset": "pool_matrix", "source_index": 6, "matrix": [[0, 3, 1, 4, 0, 0, 6], [6, 2, 0, 6, 6, 0, 7], [8, 2, 2, 5, 2, 5, 9], [2, 6, 2, 1, 5, 6, 0], [5, 2, 6, 6, 5, 6, 2], [2, 5, 4, 7, 3, 2, 0], [3, 3, 6, 0, 2, 1, 6], [9, 3, 9, 1, 7, 4, 2], [1, 6, 3, 5, 0, 7, 4], [2, 1, 9, 3, 0, 3, 0]], "pool_type": "max", "pool... | pool_matrix |
Your job is to perform max/average pooling on the given matrix.
The stride is equal to the kernel size, meaning there is no overlap between the pooling regions.
Your output should be a matrix in the same format as the input matrix.
The output matrix is smaller than the input matrix when the kernel size is greater than... | 4.0 3.5 3.0 5.5
3.5 6.0 5.5 9.0 | {"source_dataset": "pool_matrix", "source_index": 7, "matrix": [[8, 5, 6, 4, 2, 5, 5], [1, 2, 4, 0, 2, 3, 6], [1, 6, 4, 8, 3, 8, 9]], "pool_type": "average", "pool_size": 2, "solution": [[4.0, 3.5, 3.0, 5.5], [3.5, 6.0, 5.5, 9.0]], "rows": 3, "cols": 7, "difficulty": {"rows": [2, 10], "cols": [2, 10], "pool_size": [1, ... | pool_matrix |
Your job is to perform max/average pooling on the given matrix.
The stride is equal to the kernel size, meaning there is no overlap between the pooling regions.
Your output should be a matrix in the same format as the input matrix.
The output matrix is smaller than the input matrix when the kernel size is greater than... | 3.0 3.0 5.5
3.75 2.5 6.5
2.25 0.5 3.75
5.25 4.5 2.25
3.5 4.0 3.5 | {"source_dataset": "pool_matrix", "source_index": 8, "matrix": [[0, 0, 1, 4, 6, 5], [6, 6, 5, 2, 7, 4], [3, 6, 4, 1, 5, 9], [0, 6, 3, 2, 9, 3], [3, 3, 2, 0, 3, 2], [0, 3, 0, 0, 7, 3], [8, 7, 4, 4, 0, 0], [3, 3, 1, 9, 4, 5], [7, 0, 3, 5, 6, 1]], "pool_type": "average", "pool_size": 2, "solution": [[3.0, 3.0, 5.5], [3.75... | pool_matrix |
Your job is to perform max/average pooling on the given matrix.
The stride is equal to the kernel size, meaning there is no overlap between the pooling regions.
Your output should be a matrix in the same format as the input matrix.
The output matrix is smaller than the input matrix when the kernel size is greater than... | 4.67 5.0 5.56 4.0
6.67 5.33 2.83 3.0 | {"source_dataset": "pool_matrix", "source_index": 9, "matrix": [[9, 5, 0, 9, 5, 0, 5, 4, 9, 5], [5, 4, 4, 3, 6, 4, 6, 9, 1, 4], [7, 0, 8, 8, 6, 4, 5, 9, 2, 3], [7, 7, 3, 8, 2, 5, 7, 1, 3, 5], [8, 9, 6, 5, 7, 5, 1, 4, 1, 1]], "pool_type": "average", "pool_size": 3, "solution": [[4.666666666666667, 5.0, 5.555555555555555... | pool_matrix |
Your job is to perform max/average pooling on the given matrix.
The stride is equal to the kernel size, meaning there is no overlap between the pooling regions.
Your output should be a matrix in the same format as the input matrix.
The output matrix is smaller than the input matrix when the kernel size is greater than... | 7
5 | {"source_dataset": "pool_matrix", "source_index": 10, "matrix": [[5, 7], [6, 7], [0, 5], [3, 3], [1, 3], [1, 5]], "pool_type": "max", "pool_size": 3, "solution": [[7], [5]], "rows": 6, "cols": 2, "difficulty": {"rows": [2, 10], "cols": [2, 10], "pool_size": [1, 3]}} | pool_matrix |
Your job is to perform max/average pooling on the given matrix.
The stride is equal to the kernel size, meaning there is no overlap between the pooling regions.
Your output should be a matrix in the same format as the input matrix.
The output matrix is smaller than the input matrix when the kernel size is greater than... | 9 7 9
8 9 6 | {"source_dataset": "pool_matrix", "source_index": 11, "matrix": [[9, 5, 5, 6, 4, 0, 8, 9, 5], [2, 9, 4, 3, 6, 7, 9, 9, 7], [3, 6, 0, 6, 2, 0, 3, 5, 0], [5, 5, 5, 0, 7, 9, 6, 6, 4], [8, 8, 1, 8, 2, 0, 2, 6, 1]], "pool_type": "max", "pool_size": 3, "solution": [[9, 7, 9], [8, 9, 6]], "rows": 5, "cols": 9, "difficulty": {... | pool_matrix |
Your job is to perform max/average pooling on the given matrix.
The stride is equal to the kernel size, meaning there is no overlap between the pooling regions.
Your output should be a matrix in the same format as the input matrix.
The output matrix is smaller than the input matrix when the kernel size is greater than... | 9 8 9
9 7 8 | {"source_dataset": "pool_matrix", "source_index": 12, "matrix": [[5, 2, 7, 1, 0, 8, 7, 1, 9], [6, 9, 7, 4, 4, 4, 6, 4, 0], [6, 8, 9, 7, 3, 2, 1, 2, 6], [9, 8, 1, 7, 7, 2, 7, 7, 8]], "pool_type": "max", "pool_size": 3, "solution": [[9, 8, 9], [9, 7, 8]], "rows": 4, "cols": 9, "difficulty": {"rows": [2, 10], "cols": [2, ... | pool_matrix |
Your job is to perform max/average pooling on the given matrix.
The stride is equal to the kernel size, meaning there is no overlap between the pooling regions.
Your output should be a matrix in the same format as the input matrix.
The output matrix is smaller than the input matrix when the kernel size is greater than... | 7 8 5 7 5
1 6 0 3 8
7 1 5 7 8 | {"source_dataset": "pool_matrix", "source_index": 13, "matrix": [[7, 8, 5, 7, 5], [1, 6, 0, 3, 8], [7, 1, 5, 7, 8]], "pool_type": "max", "pool_size": 1, "solution": [[7, 8, 5, 7, 5], [1, 6, 0, 3, 8], [7, 1, 5, 7, 8]], "rows": 3, "cols": 5, "difficulty": {"rows": [2, 10], "cols": [2, 10], "pool_size": [1, 3]}} | pool_matrix |
Your job is to perform max/average pooling on the given matrix.
The stride is equal to the kernel size, meaning there is no overlap between the pooling regions.
Your output should be a matrix in the same format as the input matrix.
The output matrix is smaller than the input matrix when the kernel size is greater than... | 5
9
9
6
9 | {"source_dataset": "pool_matrix", "source_index": 14, "matrix": [[5, 4], [0, 2], [9, 7], [6, 4], [9, 7], [1, 8], [2, 0], [5, 6], [1, 9], [5, 5]], "pool_type": "max", "pool_size": 2, "solution": [[5], [9], [9], [6], [9]], "rows": 10, "cols": 2, "difficulty": {"rows": [2, 10], "cols": [2, 10], "pool_size": [1, 3]}} | pool_matrix |
Your job is to perform max/average pooling on the given matrix.
The stride is equal to the kernel size, meaning there is no overlap between the pooling regions.
Your output should be a matrix in the same format as the input matrix.
The output matrix is smaller than the input matrix when the kernel size is greater than... | 5.67 6.5 4.5 | {"source_dataset": "pool_matrix", "source_index": 15, "matrix": [[6, 5, 6, 8, 2, 8, 8], [1, 7, 9, 5, 8, 8, 1]], "pool_type": "average", "pool_size": 3, "solution": [[5.666666666666667, 6.5, 4.5]], "rows": 2, "cols": 7, "difficulty": {"rows": [2, 10], "cols": [2, 10], "pool_size": [1, 3]}} | pool_matrix |
Your job is to perform max/average pooling on the given matrix.
The stride is equal to the kernel size, meaning there is no overlap between the pooling regions.
Your output should be a matrix in the same format as the input matrix.
The output matrix is smaller than the input matrix when the kernel size is greater than... | 4.0 4.33
2.33 3.75 | {"source_dataset": "pool_matrix", "source_index": 16, "matrix": [[3, 0, 7, 9, 5], [3, 4, 9, 1, 5], [0, 6, 4, 4, 2], [0, 3, 3, 4, 8], [1, 1, 6, 0, 3]], "pool_type": "average", "pool_size": 3, "solution": [[4.0, 4.333333333333333], [2.3333333333333335, 3.75]], "rows": 5, "cols": 5, "difficulty": {"rows": [2, 10], "cols":... | pool_matrix |
Your job is to perform max/average pooling on the given matrix.
The stride is equal to the kernel size, meaning there is no overlap between the pooling regions.
Your output should be a matrix in the same format as the input matrix.
The output matrix is smaller than the input matrix when the kernel size is greater than... | 9
9 | {"source_dataset": "pool_matrix", "source_index": 17, "matrix": [[1, 7, 5], [9, 0, 3], [0, 3, 7], [9, 0, 9], [4, 5, 2]], "pool_type": "max", "pool_size": 3, "solution": [[9], [9]], "rows": 5, "cols": 3, "difficulty": {"rows": [2, 10], "cols": [2, 10], "pool_size": [1, 3]}} | pool_matrix |
Your job is to perform max/average pooling on the given matrix.
The stride is equal to the kernel size, meaning there is no overlap between the pooling regions.
Your output should be a matrix in the same format as the input matrix.
The output matrix is smaller than the input matrix when the kernel size is greater than... | 4.11 4.44
4.33 4.78 | {"source_dataset": "pool_matrix", "source_index": 18, "matrix": [[1, 6, 3, 8, 9, 1], [2, 1, 7, 8, 5, 2], [8, 6, 3, 2, 5, 0], [3, 4, 0, 6, 6, 9], [5, 7, 0, 2, 5, 8], [7, 9, 4, 0, 7, 0]], "pool_type": "average", "pool_size": 3, "solution": [[4.111111111111111, 4.444444444444445], [4.333333333333333, 4.777777777777778]], ... | pool_matrix |
Your job is to perform max/average pooling on the given matrix.
The stride is equal to the kernel size, meaning there is no overlap between the pooling regions.
Your output should be a matrix in the same format as the input matrix.
The output matrix is smaller than the input matrix when the kernel size is greater than... | 3.0 4.67
4.44 4.33
3.44 4.0 | {"source_dataset": "pool_matrix", "source_index": 19, "matrix": [[3, 2, 2, 0], [2, 1, 7, 5], [3, 7, 0, 9], [3, 4, 6, 2], [3, 5, 8, 2], [6, 3, 2, 9], [1, 1, 6, 5], [0, 2, 6, 2], [2, 9, 4, 5]], "pool_type": "average", "pool_size": 3, "solution": [[3.0, 4.666666666666667], [4.444444444444445, 4.333333333333333], [3.444444... | pool_matrix |
Given two strings representing a ransom note and a magazine, return True if you can construct the ransom note using the letters in the magazine, and False otherwise.
Each letter in the magazine string can only be used once in your ransom note.
Ransom note: ii
Magazine: ni
| False | {"source_dataset": "ransom_note", "source_index": 0, "ransom_note": "ii", "magazine": "ni", "solution": false, "solvable": false, "note_length": 2, "magazine_length": 2, "difficulty": {"note_length": [1, 10], "magazine_length": [2, 30]}} | ransom_note |
Given two strings representing a ransom note and a magazine, return True if you can construct the ransom note using the letters in the magazine, and False otherwise.
Each letter in the magazine string can only be used once in your ransom note.
Ransom note: z
Magazine: nblpurgfjlk
| False | {"source_dataset": "ransom_note", "source_index": 1, "ransom_note": "z", "magazine": "nblpurgfjlk", "solution": false, "solvable": false, "note_length": 1, "magazine_length": 11, "difficulty": {"note_length": [1, 10], "magazine_length": [2, 30]}} | ransom_note |
Given two strings representing a ransom note and a magazine, return True if you can construct the ransom note using the letters in the magazine, and False otherwise.
Each letter in the magazine string can only be used once in your ransom note.
Ransom note: hjifigb
Magazine: nksnnewjbeihjtriizmdidf
| False | {"source_dataset": "ransom_note", "source_index": 2, "ransom_note": "hjifigb", "magazine": "nksnnewjbeihjtriizmdidf", "solution": false, "solvable": false, "note_length": 7, "magazine_length": 23, "difficulty": {"note_length": [1, 10], "magazine_length": [2, 30]}} | ransom_note |
Given two strings representing a ransom note and a magazine, return True if you can construct the ransom note using the letters in the magazine, and False otherwise.
Each letter in the magazine string can only be used once in your ransom note.
Ransom note: ojofl
Magazine: gqfsjjwfgpxzoofokl
| True | {"source_dataset": "ransom_note", "source_index": 3, "ransom_note": "ojofl", "magazine": "gqfsjjwfgpxzoofokl", "solution": true, "solvable": true, "note_length": 5, "magazine_length": 18, "difficulty": {"note_length": [1, 10], "magazine_length": [2, 30]}} | ransom_note |
Given two strings representing a ransom note and a magazine, return True if you can construct the ransom note using the letters in the magazine, and False otherwise.
Each letter in the magazine string can only be used once in your ransom note.
Ransom note: id
Magazine: smijtlsdozqkdk
| True | {"source_dataset": "ransom_note", "source_index": 4, "ransom_note": "id", "magazine": "smijtlsdozqkdk", "solution": true, "solvable": true, "note_length": 2, "magazine_length": 14, "difficulty": {"note_length": [1, 10], "magazine_length": [2, 30]}} | ransom_note |
Given two strings representing a ransom note and a magazine, return True if you can construct the ransom note using the letters in the magazine, and False otherwise.
Each letter in the magazine string can only be used once in your ransom note.
Ransom note: dltbuy
Magazine: bldypubt
| True | {"source_dataset": "ransom_note", "source_index": 5, "ransom_note": "dltbuy", "magazine": "bldypubt", "solution": true, "solvable": true, "note_length": 6, "magazine_length": 8, "difficulty": {"note_length": [1, 10], "magazine_length": [2, 30]}} | ransom_note |
Given two strings representing a ransom note and a magazine, return True if you can construct the ransom note using the letters in the magazine, and False otherwise.
Each letter in the magazine string can only be used once in your ransom note.
Ransom note: rectemsfa
Magazine: vgrhxefsmzicaserckt
| True | {"source_dataset": "ransom_note", "source_index": 6, "ransom_note": "rectemsfa", "magazine": "vgrhxefsmzicaserckt", "solution": true, "solvable": true, "note_length": 9, "magazine_length": 19, "difficulty": {"note_length": [1, 10], "magazine_length": [2, 30]}} | ransom_note |
Given two strings representing a ransom note and a magazine, return True if you can construct the ransom note using the letters in the magazine, and False otherwise.
Each letter in the magazine string can only be used once in your ransom note.
Ransom note: gl
Magazine: vzlsrtqmrqwgu
| True | {"source_dataset": "ransom_note", "source_index": 7, "ransom_note": "gl", "magazine": "vzlsrtqmrqwgu", "solution": true, "solvable": true, "note_length": 2, "magazine_length": 13, "difficulty": {"note_length": [1, 10], "magazine_length": [2, 30]}} | ransom_note |
Given two strings representing a ransom note and a magazine, return True if you can construct the ransom note using the letters in the magazine, and False otherwise.
Each letter in the magazine string can only be used once in your ransom note.
Ransom note: llrximeo
Magazine: mnlilznrimovoegx
| True | {"source_dataset": "ransom_note", "source_index": 8, "ransom_note": "llrximeo", "magazine": "mnlilznrimovoegx", "solution": true, "solvable": true, "note_length": 8, "magazine_length": 16, "difficulty": {"note_length": [1, 10], "magazine_length": [2, 30]}} | ransom_note |
Given two strings representing a ransom note and a magazine, return True if you can construct the ransom note using the letters in the magazine, and False otherwise.
Each letter in the magazine string can only be used once in your ransom note.
Ransom note: hmii
Magazine: fwmrkkvmxtwljrkjuuixubmhngqhep
| False | {"source_dataset": "ransom_note", "source_index": 9, "ransom_note": "hmii", "magazine": "fwmrkkvmxtwljrkjuuixubmhngqhep", "solution": false, "solvable": false, "note_length": 4, "magazine_length": 30, "difficulty": {"note_length": [1, 10], "magazine_length": [2, 30]}} | ransom_note |
Given two strings representing a ransom note and a magazine, return True if you can construct the ransom note using the letters in the magazine, and False otherwise.
Each letter in the magazine string can only be used once in your ransom note.
Ransom note: atqnx
Magazine: abnqht
| False | {"source_dataset": "ransom_note", "source_index": 10, "ransom_note": "atqnx", "magazine": "abnqht", "solution": false, "solvable": false, "note_length": 5, "magazine_length": 6, "difficulty": {"note_length": [1, 10], "magazine_length": [2, 30]}} | ransom_note |
Given two strings representing a ransom note and a magazine, return True if you can construct the ransom note using the letters in the magazine, and False otherwise.
Each letter in the magazine string can only be used once in your ransom note.
Ransom note: nywwtxjqee
Magazine: twnwxqeeyzuhwjwn
| True | {"source_dataset": "ransom_note", "source_index": 11, "ransom_note": "nywwtxjqee", "magazine": "twnwxqeeyzuhwjwn", "solution": true, "solvable": true, "note_length": 10, "magazine_length": 16, "difficulty": {"note_length": [1, 10], "magazine_length": [2, 30]}} | ransom_note |
Given two strings representing a ransom note and a magazine, return True if you can construct the ransom note using the letters in the magazine, and False otherwise.
Each letter in the magazine string can only be used once in your ransom note.
Ransom note: xbx
Magazine: dsvvlamxsfeqbpoap
| False | {"source_dataset": "ransom_note", "source_index": 12, "ransom_note": "xbx", "magazine": "dsvvlamxsfeqbpoap", "solution": false, "solvable": false, "note_length": 3, "magazine_length": 17, "difficulty": {"note_length": [1, 10], "magazine_length": [2, 30]}} | ransom_note |
Given two strings representing a ransom note and a magazine, return True if you can construct the ransom note using the letters in the magazine, and False otherwise.
Each letter in the magazine string can only be used once in your ransom note.
Ransom note: wf
Magazine: wffonhwo
| True | {"source_dataset": "ransom_note", "source_index": 13, "ransom_note": "wf", "magazine": "wffonhwo", "solution": true, "solvable": true, "note_length": 2, "magazine_length": 8, "difficulty": {"note_length": [1, 10], "magazine_length": [2, 30]}} | ransom_note |
Given two strings representing a ransom note and a magazine, return True if you can construct the ransom note using the letters in the magazine, and False otherwise.
Each letter in the magazine string can only be used once in your ransom note.
Ransom note: mitnargef
Magazine: gaifnemrt
| True | {"source_dataset": "ransom_note", "source_index": 14, "ransom_note": "mitnargef", "magazine": "gaifnemrt", "solution": true, "solvable": true, "note_length": 9, "magazine_length": 9, "difficulty": {"note_length": [1, 10], "magazine_length": [2, 30]}} | ransom_note |
Given two strings representing a ransom note and a magazine, return True if you can construct the ransom note using the letters in the magazine, and False otherwise.
Each letter in the magazine string can only be used once in your ransom note.
Ransom note: j
Magazine: tkfkawlbqsmud
| False | {"source_dataset": "ransom_note", "source_index": 15, "ransom_note": "j", "magazine": "tkfkawlbqsmud", "solution": false, "solvable": false, "note_length": 1, "magazine_length": 13, "difficulty": {"note_length": [1, 10], "magazine_length": [2, 30]}} | ransom_note |
Given two strings representing a ransom note and a magazine, return True if you can construct the ransom note using the letters in the magazine, and False otherwise.
Each letter in the magazine string can only be used once in your ransom note.
Ransom note: ynqbscufkc
Magazine: csuabfndfyqypcks
| True | {"source_dataset": "ransom_note", "source_index": 16, "ransom_note": "ynqbscufkc", "magazine": "csuabfndfyqypcks", "solution": true, "solvable": true, "note_length": 10, "magazine_length": 16, "difficulty": {"note_length": [1, 10], "magazine_length": [2, 30]}} | ransom_note |
Given two strings representing a ransom note and a magazine, return True if you can construct the ransom note using the letters in the magazine, and False otherwise.
Each letter in the magazine string can only be used once in your ransom note.
Ransom note: yzjf
Magazine: jrjzfl
| False | {"source_dataset": "ransom_note", "source_index": 17, "ransom_note": "yzjf", "magazine": "jrjzfl", "solution": false, "solvable": false, "note_length": 4, "magazine_length": 6, "difficulty": {"note_length": [1, 10], "magazine_length": [2, 30]}} | ransom_note |
Given two strings representing a ransom note and a magazine, return True if you can construct the ransom note using the letters in the magazine, and False otherwise.
Each letter in the magazine string can only be used once in your ransom note.
Ransom note: syuix
Magazine: iyoxhrqujzxwqd
| False | {"source_dataset": "ransom_note", "source_index": 18, "ransom_note": "syuix", "magazine": "iyoxhrqujzxwqd", "solution": false, "solvable": false, "note_length": 5, "magazine_length": 14, "difficulty": {"note_length": [1, 10], "magazine_length": [2, 30]}} | ransom_note |
Given two strings representing a ransom note and a magazine, return True if you can construct the ransom note using the letters in the magazine, and False otherwise.
Each letter in the magazine string can only be used once in your ransom note.
Ransom note: llfjssxe
Magazine: tsllhmobufxsj
| False | {"source_dataset": "ransom_note", "source_index": 19, "ransom_note": "llfjssxe", "magazine": "tsllhmobufxsj", "solution": false, "solvable": false, "note_length": 8, "magazine_length": 13, "difficulty": {"note_length": [1, 10], "magazine_length": [2, 30]}} | ransom_note |
Given a square matrix, your job is to rotate it clockwise.
Your output should be a matrix in the same format as the input.
Rotate the matrix below by 540 degrees clockwise:
0 4 3
3 2 1
8 1 9
| 9 1 8
1 2 3
3 4 0 | {"source_dataset": "rotate_matrix", "source_index": 0, "matrix": [[0, 4, 3], [3, 2, 1], [8, 1, 9]], "num_rotations": 6, "solution": [[9, 1, 8], [1, 2, 3], [3, 4, 0]], "n": 3, "difficulty": {"n": [2, 10], "num_rotations": [0, 10]}} | rotate_matrix |
Given a square matrix, your job is to rotate it clockwise.
Your output should be a matrix in the same format as the input.
Rotate the matrix below by 900 degrees clockwise:
4 2
7 5
| 5 7
2 4 | {"source_dataset": "rotate_matrix", "source_index": 1, "matrix": [[4, 2], [7, 5]], "num_rotations": 10, "solution": [[5, 7], [2, 4]], "n": 2, "difficulty": {"n": [2, 10], "num_rotations": [0, 10]}} | rotate_matrix |
Given a square matrix, your job is to rotate it clockwise.
Your output should be a matrix in the same format as the input.
Rotate the matrix below by 180 degrees clockwise:
8 8 1 2 6 3 4 0
3 1 9 0 1 2 8 4
6 9 6 5 5 1 5 4
9 2 1 8 1 9 1 4
5 1 4 0 5 6 1 7
7 3 3 2 4 3 0 0
6 0 5 5 7 7 9 8
2 3 7 7 5 9 0 4
| 4 0 9 5 7 7 3 2
8 9 7 7 5 5 0 6
0 0 3 4 2 3 3 7
7 1 6 5 0 4 1 5
4 1 9 1 8 1 2 9
4 5 1 5 5 6 9 6
4 8 2 1 0 9 1 3
0 4 3 6 2 1 8 8 | {"source_dataset": "rotate_matrix", "source_index": 2, "matrix": [[8, 8, 1, 2, 6, 3, 4, 0], [3, 1, 9, 0, 1, 2, 8, 4], [6, 9, 6, 5, 5, 1, 5, 4], [9, 2, 1, 8, 1, 9, 1, 4], [5, 1, 4, 0, 5, 6, 1, 7], [7, 3, 3, 2, 4, 3, 0, 0], [6, 0, 5, 5, 7, 7, 9, 8], [2, 3, 7, 7, 5, 9, 0, 4]], "num_rotations": 2, "solution": [[4, 0, 9, 5,... | rotate_matrix |
Given a square matrix, your job is to rotate it clockwise.
Your output should be a matrix in the same format as the input.
Rotate the matrix below by 0 degrees clockwise:
6 7 4 1 4 5
0 1 7 0 1 4
1 4 0 9 1 2
4 2 3 6 1 9
6 2 0 0 2 5
4 5 5 1 6 1
| 6 7 4 1 4 5
0 1 7 0 1 4
1 4 0 9 1 2
4 2 3 6 1 9
6 2 0 0 2 5
4 5 5 1 6 1 | {"source_dataset": "rotate_matrix", "source_index": 3, "matrix": [[6, 7, 4, 1, 4, 5], [0, 1, 7, 0, 1, 4], [1, 4, 0, 9, 1, 2], [4, 2, 3, 6, 1, 9], [6, 2, 0, 0, 2, 5], [4, 5, 5, 1, 6, 1]], "num_rotations": 0, "solution": [[6, 7, 4, 1, 4, 5], [0, 1, 7, 0, 1, 4], [1, 4, 0, 9, 1, 2], [4, 2, 3, 6, 1, 9], [6, 2, 0, 0, 2, 5], ... | rotate_matrix |
Given a square matrix, your job is to rotate it clockwise.
Your output should be a matrix in the same format as the input.
Rotate the matrix below by 0 degrees clockwise:
6 0 9
9 3 8
2 9 8
| 6 0 9
9 3 8
2 9 8 | {"source_dataset": "rotate_matrix", "source_index": 4, "matrix": [[6, 0, 9], [9, 3, 8], [2, 9, 8]], "num_rotations": 0, "solution": [[6, 0, 9], [9, 3, 8], [2, 9, 8]], "n": 3, "difficulty": {"n": [2, 10], "num_rotations": [0, 10]}} | rotate_matrix |
Given a square matrix, your job is to rotate it clockwise.
Your output should be a matrix in the same format as the input.
Rotate the matrix below by 360 degrees clockwise:
1 6 8 7 9 5 4
8 6 6 9 0 6 0
1 0 4 7 8 0 5
9 6 3 3 8 8 5
7 3 0 8 5 5 9
5 8 9 3 3 0 2
5 1 5 9 6 8 8
| 1 6 8 7 9 5 4
8 6 6 9 0 6 0
1 0 4 7 8 0 5
9 6 3 3 8 8 5
7 3 0 8 5 5 9
5 8 9 3 3 0 2
5 1 5 9 6 8 8 | {"source_dataset": "rotate_matrix", "source_index": 5, "matrix": [[1, 6, 8, 7, 9, 5, 4], [8, 6, 6, 9, 0, 6, 0], [1, 0, 4, 7, 8, 0, 5], [9, 6, 3, 3, 8, 8, 5], [7, 3, 0, 8, 5, 5, 9], [5, 8, 9, 3, 3, 0, 2], [5, 1, 5, 9, 6, 8, 8]], "num_rotations": 4, "solution": [[1, 6, 8, 7, 9, 5, 4], [8, 6, 6, 9, 0, 6, 0], [1, 0, 4, 7, ... | rotate_matrix |
Given a square matrix, your job is to rotate it clockwise.
Your output should be a matrix in the same format as the input.
Rotate the matrix below by 720 degrees clockwise:
5 2 8 8 4 8 3 6 2 2
1 7 3 3 8 8 8 2 7 3
0 1 6 1 2 7 2 2 0 8
4 5 5 1 3 4 4 0 9 4
2 5 6 2 3 6 9 4 0 5
1 4 9 4 9 7 1 1 3 2
5 7 8 5 6 1 0 5 6 6
5 0 9... | 5 2 8 8 4 8 3 6 2 2
1 7 3 3 8 8 8 2 7 3
0 1 6 1 2 7 2 2 0 8
4 5 5 1 3 4 4 0 9 4
2 5 6 2 3 6 9 4 0 5
1 4 9 4 9 7 1 1 3 2
5 7 8 5 6 1 0 5 6 6
5 0 9 6 7 6 9 4 2 5
3 7 9 3 9 2 3 2 2 4
9 6 9 8 8 6 9 6 0 7 | {"source_dataset": "rotate_matrix", "source_index": 6, "matrix": [[5, 2, 8, 8, 4, 8, 3, 6, 2, 2], [1, 7, 3, 3, 8, 8, 8, 2, 7, 3], [0, 1, 6, 1, 2, 7, 2, 2, 0, 8], [4, 5, 5, 1, 3, 4, 4, 0, 9, 4], [2, 5, 6, 2, 3, 6, 9, 4, 0, 5], [1, 4, 9, 4, 9, 7, 1, 1, 3, 2], [5, 7, 8, 5, 6, 1, 0, 5, 6, 6], [5, 0, 9, 6, 7, 6, 9, 4, 2, 5]... | rotate_matrix |
Given a square matrix, your job is to rotate it clockwise.
Your output should be a matrix in the same format as the input.
Rotate the matrix below by 180 degrees clockwise:
5 6 1
5 8 8
0 0 4
| 4 0 0
8 8 5
1 6 5 | {"source_dataset": "rotate_matrix", "source_index": 7, "matrix": [[5, 6, 1], [5, 8, 8], [0, 0, 4]], "num_rotations": 2, "solution": [[4, 0, 0], [8, 8, 5], [1, 6, 5]], "n": 3, "difficulty": {"n": [2, 10], "num_rotations": [0, 10]}} | rotate_matrix |
Given a square matrix, your job is to rotate it clockwise.
Your output should be a matrix in the same format as the input.
Rotate the matrix below by 0 degrees clockwise:
4 5 3 7 5 1 8 5 3
8 1 2 5 1 5 5 3 3
1 5 9 9 6 1 1 9 5
6 0 3 5 4 6 1 3 7
4 9 7 2 4 9 3 8 9
1 6 9 1 8 7 6 8 8
2 7 9 8 4 1 5 8 2
0 5 0 9 6 7 8 3 2
9 1... | 4 5 3 7 5 1 8 5 3
8 1 2 5 1 5 5 3 3
1 5 9 9 6 1 1 9 5
6 0 3 5 4 6 1 3 7
4 9 7 2 4 9 3 8 9
1 6 9 1 8 7 6 8 8
2 7 9 8 4 1 5 8 2
0 5 0 9 6 7 8 3 2
9 1 2 4 6 3 5 0 8 | {"source_dataset": "rotate_matrix", "source_index": 8, "matrix": [[4, 5, 3, 7, 5, 1, 8, 5, 3], [8, 1, 2, 5, 1, 5, 5, 3, 3], [1, 5, 9, 9, 6, 1, 1, 9, 5], [6, 0, 3, 5, 4, 6, 1, 3, 7], [4, 9, 7, 2, 4, 9, 3, 8, 9], [1, 6, 9, 1, 8, 7, 6, 8, 8], [2, 7, 9, 8, 4, 1, 5, 8, 2], [0, 5, 0, 9, 6, 7, 8, 3, 2], [9, 1, 2, 4, 6, 3, 5, ... | rotate_matrix |
Given a square matrix, your job is to rotate it clockwise.
Your output should be a matrix in the same format as the input.
Rotate the matrix below by 900 degrees clockwise:
8 8 2 3 3
8 4 6 8 7
8 8 5 9 5
6 4 6 0 1
0 8 4 0 7
| 7 0 4 8 0
1 0 6 4 6
5 9 5 8 8
7 8 6 4 8
3 3 2 8 8 | {"source_dataset": "rotate_matrix", "source_index": 9, "matrix": [[8, 8, 2, 3, 3], [8, 4, 6, 8, 7], [8, 8, 5, 9, 5], [6, 4, 6, 0, 1], [0, 8, 4, 0, 7]], "num_rotations": 10, "solution": [[7, 0, 4, 8, 0], [1, 0, 6, 4, 6], [5, 9, 5, 8, 8], [7, 8, 6, 4, 8], [3, 3, 2, 8, 8]], "n": 5, "difficulty": {"n": [2, 10], "num_rotati... | rotate_matrix |
Given a square matrix, your job is to rotate it clockwise.
Your output should be a matrix in the same format as the input.
Rotate the matrix below by 720 degrees clockwise:
0 8 7 5 6 0
2 2 6 2 5 7
0 0 8 6 7 0
3 1 2 2 7 3
4 7 7 6 1 0
9 6 1 9 6 5
| 0 8 7 5 6 0
2 2 6 2 5 7
0 0 8 6 7 0
3 1 2 2 7 3
4 7 7 6 1 0
9 6 1 9 6 5 | {"source_dataset": "rotate_matrix", "source_index": 10, "matrix": [[0, 8, 7, 5, 6, 0], [2, 2, 6, 2, 5, 7], [0, 0, 8, 6, 7, 0], [3, 1, 2, 2, 7, 3], [4, 7, 7, 6, 1, 0], [9, 6, 1, 9, 6, 5]], "num_rotations": 8, "solution": [[0, 8, 7, 5, 6, 0], [2, 2, 6, 2, 5, 7], [0, 0, 8, 6, 7, 0], [3, 1, 2, 2, 7, 3], [4, 7, 7, 6, 1, 0],... | rotate_matrix |
Given a square matrix, your job is to rotate it clockwise.
Your output should be a matrix in the same format as the input.
Rotate the matrix below by 720 degrees clockwise:
7 8 7 8 5
7 0 0 2 5
2 4 0 2 0
5 3 7 3 3
2 2 5 8 5
| 7 8 7 8 5
7 0 0 2 5
2 4 0 2 0
5 3 7 3 3
2 2 5 8 5 | {"source_dataset": "rotate_matrix", "source_index": 11, "matrix": [[7, 8, 7, 8, 5], [7, 0, 0, 2, 5], [2, 4, 0, 2, 0], [5, 3, 7, 3, 3], [2, 2, 5, 8, 5]], "num_rotations": 8, "solution": [[7, 8, 7, 8, 5], [7, 0, 0, 2, 5], [2, 4, 0, 2, 0], [5, 3, 7, 3, 3], [2, 2, 5, 8, 5]], "n": 5, "difficulty": {"n": [2, 10], "num_rotati... | rotate_matrix |
Given a square matrix, your job is to rotate it clockwise.
Your output should be a matrix in the same format as the input.
Rotate the matrix below by 630 degrees clockwise:
7 8 4 7
7 6 3 7
5 9 6 3
3 0 7 8
| 7 7 3 8
4 3 6 7
8 6 9 0
7 7 5 3 | {"source_dataset": "rotate_matrix", "source_index": 12, "matrix": [[7, 8, 4, 7], [7, 6, 3, 7], [5, 9, 6, 3], [3, 0, 7, 8]], "num_rotations": 7, "solution": [[7, 7, 3, 8], [4, 3, 6, 7], [8, 6, 9, 0], [7, 7, 5, 3]], "n": 4, "difficulty": {"n": [2, 10], "num_rotations": [0, 10]}} | rotate_matrix |
Given a square matrix, your job is to rotate it clockwise.
Your output should be a matrix in the same format as the input.
Rotate the matrix below by 720 degrees clockwise:
3 2 4
1 2 4
1 5 7
| 3 2 4
1 2 4
1 5 7 | {"source_dataset": "rotate_matrix", "source_index": 13, "matrix": [[3, 2, 4], [1, 2, 4], [1, 5, 7]], "num_rotations": 8, "solution": [[3, 2, 4], [1, 2, 4], [1, 5, 7]], "n": 3, "difficulty": {"n": [2, 10], "num_rotations": [0, 10]}} | rotate_matrix |
Given a square matrix, your job is to rotate it clockwise.
Your output should be a matrix in the same format as the input.
Rotate the matrix below by 360 degrees clockwise:
0 7 8 4 8 6 3 1 5 9
1 5 4 9 3 0 9 3 0 9
8 2 6 0 2 6 3 2 1 9
3 8 3 7 2 6 2 1 3 8
2 3 2 2 8 7 5 0 0 9
5 0 9 0 8 8 1 9 7 6
5 7 5 3 8 7 8 7 0 3
2 5 7... | 0 7 8 4 8 6 3 1 5 9
1 5 4 9 3 0 9 3 0 9
8 2 6 0 2 6 3 2 1 9
3 8 3 7 2 6 2 1 3 8
2 3 2 2 8 7 5 0 0 9
5 0 9 0 8 8 1 9 7 6
5 7 5 3 8 7 8 7 0 3
2 5 7 2 0 3 4 2 9 4
7 0 2 0 9 4 8 2 8 1
0 9 4 9 6 3 0 8 7 8 | {"source_dataset": "rotate_matrix", "source_index": 14, "matrix": [[0, 7, 8, 4, 8, 6, 3, 1, 5, 9], [1, 5, 4, 9, 3, 0, 9, 3, 0, 9], [8, 2, 6, 0, 2, 6, 3, 2, 1, 9], [3, 8, 3, 7, 2, 6, 2, 1, 3, 8], [2, 3, 2, 2, 8, 7, 5, 0, 0, 9], [5, 0, 9, 0, 8, 8, 1, 9, 7, 6], [5, 7, 5, 3, 8, 7, 8, 7, 0, 3], [2, 5, 7, 2, 0, 3, 4, 2, 9, 4... | rotate_matrix |
Given a square matrix, your job is to rotate it clockwise.
Your output should be a matrix in the same format as the input.
Rotate the matrix below by 270 degrees clockwise:
5 9
9 0
| 9 0
5 9 | {"source_dataset": "rotate_matrix", "source_index": 15, "matrix": [[5, 9], [9, 0]], "num_rotations": 3, "solution": [[9, 0], [5, 9]], "n": 2, "difficulty": {"n": [2, 10], "num_rotations": [0, 10]}} | rotate_matrix |
Given a square matrix, your job is to rotate it clockwise.
Your output should be a matrix in the same format as the input.
Rotate the matrix below by 90 degrees clockwise:
3 3 0 3 7
6 5 4 4 7
9 6 4 9 1
0 7 3 7 1
7 8 6 5 0
| 7 0 9 6 3
8 7 6 5 3
6 3 4 4 0
5 7 9 4 3
0 1 1 7 7 | {"source_dataset": "rotate_matrix", "source_index": 16, "matrix": [[3, 3, 0, 3, 7], [6, 5, 4, 4, 7], [9, 6, 4, 9, 1], [0, 7, 3, 7, 1], [7, 8, 6, 5, 0]], "num_rotations": 1, "solution": [[7, 0, 9, 6, 3], [8, 7, 6, 5, 3], [6, 3, 4, 4, 0], [5, 7, 9, 4, 3], [0, 1, 1, 7, 7]], "n": 5, "difficulty": {"n": [2, 10], "num_rotati... | rotate_matrix |
Given a square matrix, your job is to rotate it clockwise.
Your output should be a matrix in the same format as the input.
Rotate the matrix below by 0 degrees clockwise:
1 7 0 2 4
0 9 0 7 6
7 8 4 2 9
5 2 8 1 1
5 0 5 4 1
| 1 7 0 2 4
0 9 0 7 6
7 8 4 2 9
5 2 8 1 1
5 0 5 4 1 | {"source_dataset": "rotate_matrix", "source_index": 17, "matrix": [[1, 7, 0, 2, 4], [0, 9, 0, 7, 6], [7, 8, 4, 2, 9], [5, 2, 8, 1, 1], [5, 0, 5, 4, 1]], "num_rotations": 0, "solution": [[1, 7, 0, 2, 4], [0, 9, 0, 7, 6], [7, 8, 4, 2, 9], [5, 2, 8, 1, 1], [5, 0, 5, 4, 1]], "n": 5, "difficulty": {"n": [2, 10], "num_rotati... | rotate_matrix |
Given a square matrix, your job is to rotate it clockwise.
Your output should be a matrix in the same format as the input.
Rotate the matrix below by 270 degrees clockwise:
4 9 2 4 3 7
7 5 0 1 2 2
6 0 3 0 6 2
2 4 9 2 8 9
8 9 0 9 9 1
4 2 0 9 3 4
| 7 2 2 9 1 4
3 2 6 8 9 3
4 1 0 2 9 9
2 0 3 9 0 0
9 5 0 4 9 2
4 7 6 2 8 4 | {"source_dataset": "rotate_matrix", "source_index": 18, "matrix": [[4, 9, 2, 4, 3, 7], [7, 5, 0, 1, 2, 2], [6, 0, 3, 0, 6, 2], [2, 4, 9, 2, 8, 9], [8, 9, 0, 9, 9, 1], [4, 2, 0, 9, 3, 4]], "num_rotations": 3, "solution": [[7, 2, 2, 9, 1, 4], [3, 2, 6, 8, 9, 3], [4, 1, 0, 2, 9, 9], [2, 0, 3, 9, 0, 0], [9, 5, 0, 4, 9, 2],... | rotate_matrix |
Given a square matrix, your job is to rotate it clockwise.
Your output should be a matrix in the same format as the input.
Rotate the matrix below by 450 degrees clockwise:
2 8 3 5 4 5 0 7 5
5 1 6 7 5 2 5 0 8
1 2 5 0 6 2 2 6 4
4 5 7 5 9 5 2 9 4
6 6 3 2 2 0 8 5 7
0 8 6 1 4 0 6 2 1
7 5 1 6 3 1 9 5 9
5 0 7 4 6 6 3 2 1
6... | 6 5 7 0 6 4 1 5 2
7 0 5 8 6 5 2 1 8
1 7 1 6 3 7 5 6 3
4 4 6 1 2 5 0 7 5
7 6 3 4 2 9 6 5 4
6 6 1 0 0 5 2 2 5
0 3 9 6 8 2 2 5 0
5 2 5 2 5 9 6 0 7
3 1 9 1 7 4 4 8 5 | {"source_dataset": "rotate_matrix", "source_index": 19, "matrix": [[2, 8, 3, 5, 4, 5, 0, 7, 5], [5, 1, 6, 7, 5, 2, 5, 0, 8], [1, 2, 5, 0, 6, 2, 2, 6, 4], [4, 5, 7, 5, 9, 5, 2, 9, 4], [6, 6, 3, 2, 2, 0, 8, 5, 7], [0, 8, 6, 1, 4, 0, 6, 2, 1], [7, 5, 1, 6, 3, 1, 9, 5, 9], [5, 0, 7, 4, 6, 6, 3, 2, 1], [6, 7, 1, 4, 7, 6, 0,... | rotate_matrix |
You are given an n x n grid where each cell can have one of three values:
- 0 representing an empty cell
- 1 representing a fresh orange
- 2 representing a rotten orange
Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten.
Your task is determine the minimum number of minu... | 6 | {"source_dataset": "rotten_oranges", "source_index": 0, "matrix": [[1, 1, 1, 1, 2, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 2, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1], [1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 2, 1, 0], [1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0,... | rotten_oranges |
You are given an n x n grid where each cell can have one of three values:
- 0 representing an empty cell
- 1 representing a fresh orange
- 2 representing a rotten orange
Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten.
Your task is determine the minimum number of minu... | -1 | {"source_dataset": "rotten_oranges", "source_index": 1, "matrix": [[1, 0, 1, 1, 1, 1, 0, 0, 0, 2, 1], [1, 1, 1, 1, 1, 2, 1, 1, 0, 1, 2], [1, 1, 1, 1, 1, 0, 1, 2, 0, 1, 0], [1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 2], [1, 1, 1, 1, 1, 2, 1, 1, 0, 1, 1], [2, 1, 1, 1, 1, 1, 1, 1, 2, 0, 1], [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [1, 0, 1... | rotten_oranges |
You are given an n x n grid where each cell can have one of three values:
- 0 representing an empty cell
- 1 representing a fresh orange
- 2 representing a rotten orange
Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten.
Your task is determine the minimum number of minu... | 13 | {"source_dataset": "rotten_oranges", "source_index": 2, "matrix": [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 0, 1, 1, 1, 1, 1], [1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 2, 1, 2, 1, 1, 0, 0], [1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 0, 1], [0, 0, 2, 0, 1, 1, 1, 0, 1, 1, 0, 2, 1, ... | rotten_oranges |
You are given an n x n grid where each cell can have one of three values:
- 0 representing an empty cell
- 1 representing a fresh orange
- 2 representing a rotten orange
Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten.
Your task is determine the minimum number of minu... | 8 | {"source_dataset": "rotten_oranges", "source_index": 3, "matrix": [[1, 2, 1, 1, 0, 1, 1, 0, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1], [1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1], [1, 1, 1, 2, 0, 1, 1, 2, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1], [1, 1, 1, 1, 0, 2, 2, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1], [2, 1, 1, 1, 1, 1, 2, 1, 1, 1... | rotten_oranges |
You are given an n x n grid where each cell can have one of three values:
- 0 representing an empty cell
- 1 representing a fresh orange
- 2 representing a rotten orange
Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten.
Your task is determine the minimum number of minu... | 5 | {"source_dataset": "rotten_oranges", "source_index": 4, "matrix": [[1, 0, 1, 1, 2, 1, 1, 0, 1, 0, 1, 1], [2, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2], [1, 1, 1, 1, 2, 1, 2, 1, 1, 0, 1, 1], [2, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 0], [0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 2, 1], [1, 0, 2, 1, 2, 0, 2, 1, 2, 1, 1, 1], [1, 1, 1, 1, 1, 1, 1, 1, ... | rotten_oranges |
You are given an n x n grid where each cell can have one of three values:
- 0 representing an empty cell
- 1 representing a fresh orange
- 2 representing a rotten orange
Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten.
Your task is determine the minimum number of minu... | -1 | {"source_dataset": "rotten_oranges", "source_index": 5, "matrix": [[1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 2, 1, 2, 0, 1], [1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1], [0, 0, 1, 1, 1, 0, 0, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [1, 1, 0, 1, 1, 1, 0, 1, 2, 1, 0, 1, 2, 1, 1, 1, 1, 1, 1, ... | rotten_oranges |
You are given an n x n grid where each cell can have one of three values:
- 0 representing an empty cell
- 1 representing a fresh orange
- 2 representing a rotten orange
Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten.
Your task is determine the minimum number of minu... | -1 | {"source_dataset": "rotten_oranges", "source_index": 6, "matrix": [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 2, 1, 1, 0, 1, 1, 1, 2, 1, 1, 1, 0, 1, 1], [1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1], [0, 1, 2, 1, 0, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 2, 1, 1, 1, 1, 0, 1, 1], [2, ... | rotten_oranges |
You are given an n x n grid where each cell can have one of three values:
- 0 representing an empty cell
- 1 representing a fresh orange
- 2 representing a rotten orange
Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten.
Your task is determine the minimum number of minu... | 8 | {"source_dataset": "rotten_oranges", "source_index": 7, "matrix": [[1, 1, 1, 1, 2, 1, 0, 1, 1, 1, 1, 1], [2, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0], [2, 0, 1, 0, 0, 2, 1, 1, 1, 1, 1, 1], [1, 2, 2, 0, 1, 2, 1, 1, 1, 1, 1, 1], [1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1], [1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1], [1, 0, 0, 1, 2, 1, 1, 0, ... | rotten_oranges |
You are given an n x n grid where each cell can have one of three values:
- 0 representing an empty cell
- 1 representing a fresh orange
- 2 representing a rotten orange
Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten.
Your task is determine the minimum number of minu... | 6 | {"source_dataset": "rotten_oranges", "source_index": 8, "matrix": [[0, 1, 1, 1, 1, 0, 2, 1, 1, 0, 0, 2, 0, 1, 1, 2, 1, 1, 1, 0, 1, 1, 1, 0, 0], [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 0, 1, 1, 1, 2, 2, 2, 1, 1, 1], [0, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1], [1, 1, 1, 0, 1, 1, 1, ... | rotten_oranges |
You are given an n x n grid where each cell can have one of three values:
- 0 representing an empty cell
- 1 representing a fresh orange
- 2 representing a rotten orange
Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten.
Your task is determine the minimum number of minu... | 6 | {"source_dataset": "rotten_oranges", "source_index": 9, "matrix": [[1, 1, 1, 0, 1, 1, 1, 1, 2, 1, 1, 0, 1, 1, 0, 1, 1], [2, 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 2, 1, 1], [1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0], [0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1], [1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0... | rotten_oranges |
You are given an n x n grid where each cell can have one of three values:
- 0 representing an empty cell
- 1 representing a fresh orange
- 2 representing a rotten orange
Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten.
Your task is determine the minimum number of minu... | 7 | {"source_dataset": "rotten_oranges", "source_index": 10, "matrix": [[1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1], [2, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1], [1, 1, 1, 1, 0, 2, 1, 1, 1, 1, 2, 1, 1, 0, 1, 1, 1, 1], [0, 1, 1, 0, 1, 2, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1], [0, 2, 1, 1, 1, 1, 1, 2, 1, ... | rotten_oranges |
You are given an n x n grid where each cell can have one of three values:
- 0 representing an empty cell
- 1 representing a fresh orange
- 2 representing a rotten orange
Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten.
Your task is determine the minimum number of minu... | 9 | {"source_dataset": "rotten_oranges", "source_index": 11, "matrix": [[0, 1, 1, 1, 1, 0, 0, 1, 0, 2, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1], [0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2], [1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 2, 1, 1, 1, 1, 1, 1, 0, 2, 1, 1, 1, 1, 1, 1... | rotten_oranges |
You are given an n x n grid where each cell can have one of three values:
- 0 representing an empty cell
- 1 representing a fresh orange
- 2 representing a rotten orange
Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten.
Your task is determine the minimum number of minu... | 4 | {"source_dataset": "rotten_oranges", "source_index": 12, "matrix": [[1, 0, 1, 1, 0, 0, 1, 1, 2, 1, 1, 1, 0, 0], [2, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0], [1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 2, 1], [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0], [1, 1, 1, 1, 1, 2, 1, 1, 0, 1, 1, 1, 1, 1], [1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1... | rotten_oranges |
You are given an n x n grid where each cell can have one of three values:
- 0 representing an empty cell
- 1 representing a fresh orange
- 2 representing a rotten orange
Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten.
Your task is determine the minimum number of minu... | 5 | {"source_dataset": "rotten_oranges", "source_index": 13, "matrix": [[0, 1, 2, 2, 0, 0, 0, 1, 1, 0, 0, 2], [1, 2, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1], [1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1], [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1], [0, 1, 1, 2, 1, 1, 0, 1, 0, 2, 1, 1], [1, 1, 1, 1, 2, 1, 2, 2, 1, 1, 1, 2], [1, 1, 1, 1, 1, 1, 1, 1,... | rotten_oranges |
You are given an n x n grid where each cell can have one of three values:
- 0 representing an empty cell
- 1 representing a fresh orange
- 2 representing a rotten orange
Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten.
Your task is determine the minimum number of minu... | 7 | {"source_dataset": "rotten_oranges", "source_index": 14, "matrix": [[1, 1, 0, 2, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1], [1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0], [1, 1, 0, 1, 1, 1, 1, 1, 2, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1], [1,... | rotten_oranges |
You are given an n x n grid where each cell can have one of three values:
- 0 representing an empty cell
- 1 representing a fresh orange
- 2 representing a rotten orange
Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten.
Your task is determine the minimum number of minu... | 9 | {"source_dataset": "rotten_oranges", "source_index": 15, "matrix": [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [1, 1, 1, 1, 1, 0, 1, 2, 2, 1, 1], [1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1], [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [2, 0, 2, 1, 0, 1, 1, 1, 1, 1, 1], [1, 1, 1, 1, 2, 2, 0, 2, 1, 1, 1], [1, 1, 2, 0, 1, 1, 1, 0, 1, 0, 1], [1, 1, ... | rotten_oranges |
You are given an n x n grid where each cell can have one of three values:
- 0 representing an empty cell
- 1 representing a fresh orange
- 2 representing a rotten orange
Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten.
Your task is determine the minimum number of minu... | -1 | {"source_dataset": "rotten_oranges", "source_index": 16, "matrix": [[1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 2, 1, 1, 0, 1, 1, 1, 2, 0], [1, 1, 1, 1, 2, 1, 1, 2, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0], [1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 2, 1, 1, 1, 1, 1, 1, 1, 1... | rotten_oranges |
You are given an n x n grid where each cell can have one of three values:
- 0 representing an empty cell
- 1 representing a fresh orange
- 2 representing a rotten orange
Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten.
Your task is determine the minimum number of minu... | -1 | {"source_dataset": "rotten_oranges", "source_index": 17, "matrix": [[1, 1, 2, 1, 1, 0, 1, 1, 1, 1, 2, 2, 2, 2, 1, 0, 1], [0, 1, 2, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1], [1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1], [1, 0, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 0, 0, 1], [1, 2, 0, 1, 1, 2, 1, 1, 1, 1, 0, 1, 1, ... | rotten_oranges |
You are given an n x n grid where each cell can have one of three values:
- 0 representing an empty cell
- 1 representing a fresh orange
- 2 representing a rotten orange
Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten.
Your task is determine the minimum number of minu... | 6 | {"source_dataset": "rotten_oranges", "source_index": 18, "matrix": [[1, 1, 0, 0, 1, 1, 2, 1, 1, 1, 1, 1, 1, 0, 1, 1, 2, 1, 1], [1, 1, 1, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1], [1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 2, 1, 1, 1, 1, 0, 1, 0], [1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 2], [1, 1, 1, 1, 2, ... | rotten_oranges |
You are given an n x n grid where each cell can have one of three values:
- 0 representing an empty cell
- 1 representing a fresh orange
- 2 representing a rotten orange
Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten.
Your task is determine the minimum number of minu... | 8 | {"source_dataset": "rotten_oranges", "source_index": 19, "matrix": [[1, 0, 1, 1, 1, 0, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 1], [2, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0], [1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0], [1, 1, 1, 1, 1, 1, 1,... | rotten_oranges |
Restore the correct order of words in the following sentence: wish could get I sleep. "I some | "I wish I could get some sleep. | {"source_dataset": "sentence_reordering", "source_index": 0, "word_count": 7, "difficulty": {"words_in_sentence": [3, 20]}} | sentence_reordering |
Restore the correct order of words in the following sentence: the high level name. itself its unable it maintain at was of to Unfortunately, | Unfortunately, it was unable to maintain itself at the high level of its name. | {"source_dataset": "sentence_reordering", "source_index": 1, "word_count": 14, "difficulty": {"words_in_sentence": [3, 20]}} | sentence_reordering |
Restore the correct order of words in the following sentence: developed by For the unutilized. energy falls ages went the | For ages the the energy developed by falls went unutilized. | {"source_dataset": "sentence_reordering", "source_index": 2, "word_count": 10, "difficulty": {"words_in_sentence": [3, 20]}} | sentence_reordering |
Restore the correct order of words in the following sentence: In Mr. that said case," | In that case," said Mr. | {"source_dataset": "sentence_reordering", "source_index": 3, "word_count": 5, "difficulty": {"words_in_sentence": [3, 20]}} | sentence_reordering |
Restore the correct order of words in the following sentence: first thing Mr. that The | The first thing that Mr. | {"source_dataset": "sentence_reordering", "source_index": 4, "word_count": 5, "difficulty": {"words_in_sentence": [3, 20]}} | sentence_reordering |
Restore the correct order of words in the following sentence: is who so 3000 It away. thus or miles to take one _tête-à-tête_ with breakfast delightful is | It is is delightful thus to take breakfast _tête-à-tête_ with one who 3000 miles or so away. | {"source_dataset": "sentence_reordering", "source_index": 5, "word_count": 19, "difficulty": {"words_in_sentence": [3, 20]}} | sentence_reordering |
Restore the correct order of words in the following sentence: home? But, are coming pray, when you | But, pray, when are you coming home? | {"source_dataset": "sentence_reordering", "source_index": 6, "word_count": 7, "difficulty": {"words_in_sentence": [3, 20]}} | sentence_reordering |
Restore the correct order of words in the following sentence: at present take this then 25th of Let year 2889. September random us | Let us then take at random September 25th of this present year 2889. | {"source_dataset": "sentence_reordering", "source_index": 7, "word_count": 13, "difficulty": {"words_in_sentence": [3, 20]}} | sentence_reordering |
Restore the correct order of words in the following sentence: the was by was quite a It of opening. dark sound he when door aroused | It was was quite dark when he aroused by the sound of a door opening. | {"source_dataset": "sentence_reordering", "source_index": 8, "word_count": 15, "difficulty": {"words_in_sentence": [3, 20]}} | sentence_reordering |
Restore the correct order of words in the following sentence: sky! Smith, cloudless "a | Smith, "a cloudless sky! | {"source_dataset": "sentence_reordering", "source_index": 9, "word_count": 4, "difficulty": {"words_in_sentence": [3, 20]}} | sentence_reordering |
Restore the correct order of words in the following sentence: answered wish? all the that "True," we can "but we do " Russian; | " "True," answered the Russian; "but can we we do all that wish? | {"source_dataset": "sentence_reordering", "source_index": 10, "word_count": 12, "difficulty": {"words_in_sentence": [3, 20]}} | sentence_reordering |
Restore the correct order of words in the following sentence: ' every one exclaims present. | ' exclaims every one present. | {"source_dataset": "sentence_reordering", "source_index": 11, "word_count": 4, "difficulty": {"words_in_sentence": [3, 20]}} | sentence_reordering |
Restore the correct order of words in the following sentence: enters Smith continues the round hall. and reporters' his | Smith continues his round and enters the reporters' hall. | {"source_dataset": "sentence_reordering", "source_index": 12, "word_count": 9, "difficulty": {"words_in_sentence": [3, 20]}} | sentence_reordering |
Restore the correct order of words in the following sentence: a pronouncing name--Fritz! talking, name--his is She | She is talking, pronouncing a name--his name--Fritz! | {"source_dataset": "sentence_reordering", "source_index": 13, "word_count": 9, "difficulty": {"words_in_sentence": [3, 20]}} | sentence_reordering |
Restore the correct order of words in the following sentence: said "Good-by, while," then, a little for " Mr. | " "Good-by, then, for a little while," said Mr. | {"source_dataset": "sentence_reordering", "source_index": 14, "word_count": 9, "difficulty": {"words_in_sentence": [3, 20]}} | sentence_reordering |
Restore the correct order of words in the following sentence: Mr. subscription contained thousand names, hundred ago but then a its Twenty and few list years | Twenty years ago its subscription list contained but a few hundred thousand names, and then Mr. | {"source_dataset": "sentence_reordering", "source_index": 15, "word_count": 16, "difficulty": {"words_in_sentence": [3, 20]}} | sentence_reordering |
Restore the correct order of words in the following sentence: alone, Left Mr. | Left alone, Mr. | {"source_dataset": "sentence_reordering", "source_index": 16, "word_count": 3, "difficulty": {"words_in_sentence": [3, 20]}} | sentence_reordering |
Restore the correct order of words in the following sentence: of settled. are definitively Olympus "The elements | "The elements of Olympus are definitively settled. | {"source_dataset": "sentence_reordering", "source_index": 17, "word_count": 7, "difficulty": {"words_in_sentence": [3, 20]}} | sentence_reordering |
Restore the correct order of words in the following sentence: slightest Smith, the without irritation. manifesting | Smith, without manifesting the slightest irritation. | {"source_dataset": "sentence_reordering", "source_index": 18, "word_count": 6, "difficulty": {"words_in_sentence": [3, 20]}} | sentence_reordering |
Restore the correct order of words in the following sentence: not did by it was the the hour, Entranced notice forgetful dark. that harmony, Smith of growing | Entranced by the the harmony, forgetful of hour, Smith did not notice that it was growing dark. | {"source_dataset": "sentence_reordering", "source_index": 19, "word_count": 17, "difficulty": {"words_in_sentence": [3, 20]}} | sentence_reordering |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.