inputs stringlengths 102 186 | targets sequencelengths 1 1 | multiple_choice_targets sequencelengths 2 10 | multiple_choice_scores sequencelengths 2 10 | idx int32 0 797 |
|---|---|---|---|---|
Given two strings, determine the length of the longest common subsequence.
Strings: JDZIOBDGFHHBJJWTLISSYXNGBPYOAA BTDRPNVRSBWXFCEPOSWAOYHIQAJKFFF
Length of longest common subsequence: | [
"9"
] | [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8",
"9"
] | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
1
] | 191 |
Determine whether the given sequence of parentheses is properly matched.
Sequence: [ [ [ [ [ ] ] ] { { } } [ ] ] ] [ [ ] [
Valid/Invalid? | [
"Invalid"
] | [
"Valid",
"Invalid"
] | [
0,
1
] | 401 |
Determine whether the given sequence of parentheses is properly matched.
Sequence: } [
Valid/Invalid? | [
"Invalid"
] | [
"Valid",
"Invalid"
] | [
0,
1
] | 677 |
Determine whether the given sequence of parentheses is properly matched.
Sequence: [ ] ( ) { ] { } [ ] { { } } { ( [ ] ] }
Valid/Invalid? | [
"Invalid"
] | [
"Valid",
"Invalid"
] | [
0,
1
] | 142 |
Determine whether the given sequence of parentheses is properly matched.
Sequence: ( ) ( [ ] ) { [ [ ] ] [ ( ) ] [ ] { } }
Valid/Invalid? | [
"Valid"
] | [
"Valid",
"Invalid"
] | [
1,
0
] | 767 |
Determine whether the given sequence of parentheses is properly matched.
Sequence: [ [ ] ] ( ) ( ) { }
Valid/Invalid? | [
"Valid"
] | [
"Valid",
"Invalid"
] | [
1,
0
] | 221 |
Given two strings, determine the length of the longest common subsequence.
Strings: SNGAVZEZAZJGWBDCLLJQJEFLG NELNFIYRLBYCXXMYPQGEXG
Length of longest common subsequence: | [
"7"
] | [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8",
"9"
] | [
0,
0,
0,
0,
0,
0,
0,
1,
0,
0
] | 14 |
Determine whether the given sequence of parentheses is properly matched.
Sequence: ( [ ] ] [ [ ] ] ( ) { } [ ( ) [ ] ] ( {
Valid/Invalid? | [
"Invalid"
] | [
"Valid",
"Invalid"
] | [
0,
1
] | 207 |
Determine whether the given sequence of parentheses is properly matched.
Sequence: { ] { ( { { { ] } } { ( ( [ ] ) ) } ) }
Valid/Invalid? | [
"Invalid"
] | [
"Valid",
"Invalid"
] | [
0,
1
] | 300 |
Given two strings, determine the length of the longest common subsequence.
Strings: OXTCJQRRTHWDOTJYAGBT QRVTEPDPTZPXAXGPOBRTFJOGZDV
Length of longest common subsequence: | [
"9"
] | [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8",
"9"
] | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
1
] | 140 |
Determine whether the given sequence of parentheses is properly matched.
Sequence: [ ] ( ( [ ] ) ( ( ) ) ) ( [ ] ( ( ) ) )
Valid/Invalid? | [
"Valid"
] | [
"Valid",
"Invalid"
] | [
1,
0
] | 12 |
Determine whether the given sequence of parentheses is properly matched.
Sequence: { } { ( ) { } } ( )
Valid/Invalid? | [
"Valid"
] | [
"Valid",
"Invalid"
] | [
1,
0
] | 62 |
Determine whether the given sequence of parentheses is properly matched.
Sequence: ) ) ) } { { ) ] ) } ) } ) ) } } ) } ) }
Valid/Invalid? | [
"Invalid"
] | [
"Valid",
"Invalid"
] | [
0,
1
] | 3 |
Determine whether the given sequence of parentheses is properly matched.
Sequence: [ { [ ] } { { ( [ ] ) [ [ ] ] ( ) } } ]
Valid/Invalid? | [
"Valid"
] | [
"Valid",
"Invalid"
] | [
1,
0
] | 350 |
Determine whether the given sequence of parentheses is properly matched.
Sequence: [ ( ] { { ( [ ( ( ) { } ) ] ( ) ) } } ]
Valid/Invalid? | [
"Invalid"
] | [
"Valid",
"Invalid"
] | [
0,
1
] | 113 |
Given two strings, determine the length of the longest common subsequence.
Strings: DFHFTUUZTMEGMHNEFPZ IFIGWCNVGEDBBTFDUNHLNNNIAJ
Length of longest common subsequence: | [
"5"
] | [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8",
"9"
] | [
0,
0,
0,
0,
0,
1,
0,
0,
0,
0
] | 4 |
Determine whether the given sequence of parentheses is properly matched.
Sequence: ( ) ( ] { } ) ( { }
Valid/Invalid? | [
"Invalid"
] | [
"Valid",
"Invalid"
] | [
0,
1
] | 707 |
Determine whether the given sequence of parentheses is properly matched.
Sequence: [ ] [ ] ( ) [ [ ] { [ { } ] } ] [ } { }
Valid/Invalid? | [
"Invalid"
] | [
"Valid",
"Invalid"
] | [
0,
1
] | 34 |
Determine whether the given sequence of parentheses is properly matched.
Sequence: { { { { } { } } ) }
Valid/Invalid? | [
"Invalid"
] | [
"Valid",
"Invalid"
] | [
0,
1
] | 56 |
Determine whether the given sequence of parentheses is properly matched.
Sequence: [ ] { } ( { } ) { } ) ( ) { } [ ] ( ) (
Valid/Invalid? | [
"Invalid"
] | [
"Valid",
"Invalid"
] | [
0,
1
] | 550 |
Determine whether the given sequence of parentheses is properly matched.
Sequence: ) ( ) {
Valid/Invalid? | [
"Invalid"
] | [
"Valid",
"Invalid"
] | [
0,
1
] | 228 |
Determine whether the given sequence of parentheses is properly matched.
Sequence: [ ( ) ] [ [ ] ( ) ]
Valid/Invalid? | [
"Valid"
] | [
"Valid",
"Invalid"
] | [
1,
0
] | 616 |
Given two strings, determine the length of the longest common subsequence.
Strings: HDMAPHPVOMFOHLQJPVCMSQYKJLV DRYSSVFFXQGLYBGRSMIBUTBITRASV
Length of longest common subsequence: | [
"7"
] | [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8",
"9"
] | [
0,
0,
0,
0,
0,
0,
0,
1,
0,
0
] | 217 |
Determine whether the given sequence of parentheses is properly matched.
Sequence: ( { } [ ] ) { } [ ( ( ) ( ) ) ] [ ] ( )
Valid/Invalid? | [
"Valid"
] | [
"Valid",
"Invalid"
] | [
1,
0
] | 314 |
Determine whether the given sequence of parentheses is properly matched.
Sequence: [ ] { } { } [ [ ] ] ( ) { } ( { ( ) } )
Valid/Invalid? | [
"Valid"
] | [
"Valid",
"Invalid"
] | [
1,
0
] | 607 |
Determine whether the given sequence of parentheses is properly matched.
Sequence: { ( ) } { [ [ ] ] }
Valid/Invalid? | [
"Valid"
] | [
"Valid",
"Invalid"
] | [
1,
0
] | 103 |
Determine whether the given sequence of parentheses is properly matched.
Sequence: } } } } } ) ( ( ] } } } } ) ) ) ) } ) }
Valid/Invalid? | [
"Invalid"
] | [
"Valid",
"Invalid"
] | [
0,
1
] | 419 |
Determine whether the given sequence of parentheses is properly matched.
Sequence: } ) { { ] ] ( ) ( } ( { } ] ) } [ ] ) )
Valid/Invalid? | [
"Invalid"
] | [
"Valid",
"Invalid"
] | [
0,
1
] | 326 |
Determine whether the given sequence of parentheses is properly matched.
Sequence: ( { ( { { { } } } ( ) { ( ) } ( ) ) { }
Valid/Invalid? | [
"Invalid"
] | [
"Valid",
"Invalid"
] | [
0,
1
] | 168 |
Determine whether the given sequence of parentheses is properly matched.
Sequence: ( { [ ] [ { { { [ [ [ ] ] ] } } } ] } )
Valid/Invalid? | [
"Valid"
] | [
"Valid",
"Invalid"
] | [
1,
0
] | 508 |
Determine whether the given sequence of parentheses is properly matched.
Sequence: { ( ( ) ) ( ) [ ] ( [ { } ] ( [ ] ) ) }
Valid/Invalid? | [
"Valid"
] | [
"Valid",
"Invalid"
] | [
1,
0
] | 378 |
Given two strings, determine the length of the longest common subsequence.
Strings: VLZNAPYUVZTHKPHNPHOYMJYPOGVI QWFMTALPIWBIYCPWZNOVPZVEK
Length of longest common subsequence: | [
"8"
] | [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8",
"9"
] | [
0,
0,
0,
0,
0,
0,
0,
0,
1,
0
] | 7 |
Determine whether the given sequence of parentheses is properly matched.
Sequence: { ( ( ) [ ] [ ] ( { { } ( [ ] ) } ) ) }
Valid/Invalid? | [
"Valid"
] | [
"Valid",
"Invalid"
] | [
1,
0
] | 65 |
Determine whether the given sequence of parentheses is properly matched.
Sequence: ( { } { } ) { } ( )
Valid/Invalid? | [
"Valid"
] | [
"Valid",
"Invalid"
] | [
1,
0
] | 9 |
Given two strings, determine the length of the longest common subsequence.
Strings: OQOWSVSUTBYWBPODZSGNEFNUPERNLX OUWYNHDELPQNALGJ
Length of longest common subsequence: | [
"8"
] | [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8",
"9"
] | [
0,
0,
0,
0,
0,
0,
0,
0,
1,
0
] | 127 |
Determine whether the given sequence of parentheses is properly matched.
Sequence: [ ] [ ] ( ) ( ) { } { } { } { ( [ ] ) }
Valid/Invalid? | [
"Valid"
] | [
"Valid",
"Invalid"
] | [
1,
0
] | 545 |
Determine whether the given sequence of parentheses is properly matched.
Sequence: [ } ( ]
Valid/Invalid? | [
"Invalid"
] | [
"Valid",
"Invalid"
] | [
0,
1
] | 759 |
Determine whether the given sequence of parentheses is properly matched.
Sequence: { ] } {
Valid/Invalid? | [
"Invalid"
] | [
"Valid",
"Invalid"
] | [
0,
1
] | 630 |
Determine whether the given sequence of parentheses is properly matched.
Sequence: ( { { } { { { } ( { } ( ( ) ) ) } } } )
Valid/Invalid? | [
"Valid"
] | [
"Valid",
"Invalid"
] | [
1,
0
] | 353 |
Determine whether the given sequence of parentheses is properly matched.
Sequence: [ ] [ ] [ ] { } ( ) [ ] { ( ) } { [ ] }
Valid/Invalid? | [
"Valid"
] | [
"Valid",
"Invalid"
] | [
1,
0
] | 505 |
Determine whether the given sequence of parentheses is properly matched.
Sequence: ) { ) {
Valid/Invalid? | [
"Invalid"
] | [
"Valid",
"Invalid"
] | [
0,
1
] | 388 |
Determine whether the given sequence of parentheses is properly matched.
Sequence: [ ) [ { } [ ] ] { }
Valid/Invalid? | [
"Invalid"
] | [
"Valid",
"Invalid"
] | [
0,
1
] | 794 |
Given two strings, determine the length of the longest common subsequence.
Strings: FEJXMRCGTZCSQBIEUEPADOXRCR IKCEXOZDZNLUIQHKSVY
Length of longest common subsequence: | [
"4"
] | [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8",
"9"
] | [
0,
0,
0,
0,
1,
0,
0,
0,
0,
0
] | 255 |
Determine whether the given sequence of parentheses is properly matched.
Sequence: [ { [ { } } } } { } { ( ) ( ( ) ) } ( )
Valid/Invalid? | [
"Invalid"
] | [
"Valid",
"Invalid"
] | [
0,
1
] | 339 |
Determine whether the given sequence of parentheses is properly matched.
Sequence: { } [ ] ( ) [ [ { ( [ ] ) } ( ) ( ( { }
Valid/Invalid? | [
"Invalid"
] | [
"Valid",
"Invalid"
] | [
0,
1
] | 10 |
Determine whether the given sequence of parentheses is properly matched.
Sequence: ( { } ) ( ( ( ) ) )
Valid/Invalid? | [
"Valid"
] | [
"Valid",
"Invalid"
] | [
1,
0
] | 187 |
Determine whether the given sequence of parentheses is properly matched.
Sequence: [ ( [ ] ] ] ( [ ] ) ( ( ) ) ( [ ( } ] )
Valid/Invalid? | [
"Invalid"
] | [
"Valid",
"Invalid"
] | [
0,
1
] | 79 |
Determine whether the given sequence of parentheses is properly matched.
Sequence: } ( ) { ] [ } ) ) ( [ ) [ [ ) ) { ) } [
Valid/Invalid? | [
"Invalid"
] | [
"Valid",
"Invalid"
] | [
0,
1
] | 651 |
Determine whether the given sequence of parentheses is properly matched.
Sequence: [ ] ( [ ] ( ) ) ( )
Valid/Invalid? | [
"Valid"
] | [
"Valid",
"Invalid"
] | [
1,
0
] | 389 |
Given two strings, determine the length of the longest common subsequence.
Strings: ERPQWLJIKWNRDYTLGPZHVJWSFN BDWJWMWIQLICLN
Length of longest common subsequence: | [
"5"
] | [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8",
"9"
] | [
0,
0,
0,
0,
0,
1,
0,
0,
0,
0
] | 206 |
Determine whether the given sequence of parentheses is properly matched.
Sequence: } [ ] }
Valid/Invalid? | [
"Invalid"
] | [
"Valid",
"Invalid"
] | [
0,
1
] | 158 |
Determine whether the given sequence of parentheses is properly matched.
Sequence: [ ] { } { } ( ) [ ]
Valid/Invalid? | [
"Valid"
] | [
"Valid",
"Invalid"
] | [
1,
0
] | 80 |
Determine whether the given sequence of parentheses is properly matched.
Sequence: { ] } ) ) ) } ) ) } ) ) ) { ] ) ) } } }
Valid/Invalid? | [
"Invalid"
] | [
"Valid",
"Invalid"
] | [
0,
1
] | 134 |
Determine whether the given sequence of parentheses is properly matched.
Sequence: ( ] ( ) ( ( ] ) [ ]
Valid/Invalid? | [
"Invalid"
] | [
"Valid",
"Invalid"
] | [
0,
1
] | 127 |
Determine whether the given sequence of parentheses is properly matched.
Sequence: ( [ { } ] ) [ [ ] ]
Valid/Invalid? | [
"Valid"
] | [
"Valid",
"Invalid"
] | [
1,
0
] | 284 |
Given two strings, determine the length of the longest common subsequence.
Strings: CHWTAICFFAT YHNQTPXSVDYRPOMWYARFOEZTOYH
Length of longest common subsequence: | [
"5"
] | [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8",
"9"
] | [
0,
0,
0,
0,
0,
1,
0,
0,
0,
0
] | 41 |
Determine whether the given sequence of parentheses is properly matched.
Sequence: { ] ( ]
Valid/Invalid? | [
"Invalid"
] | [
"Valid",
"Invalid"
] | [
0,
1
] | 568 |
Determine whether the given sequence of parentheses is properly matched.
Sequence: ( ) { { } } { { } }
Valid/Invalid? | [
"Valid"
] | [
"Valid",
"Invalid"
] | [
1,
0
] | 269 |
Determine whether the given sequence of parentheses is properly matched.
Sequence: [ } } [ ( ) ) ) } [ [ ) ) { ) ( } [ ] )
Valid/Invalid? | [
"Invalid"
] | [
"Valid",
"Invalid"
] | [
0,
1
] | 240 |
Determine whether the given sequence of parentheses is properly matched.
Sequence: { { [ ] } ) ( ( ) ) { ( ( ( ) } ) } ( )
Valid/Invalid? | [
"Invalid"
] | [
"Valid",
"Invalid"
] | [
0,
1
] | 654 |
Determine whether the given sequence of parentheses is properly matched.
Sequence: ( ] [ ]
Valid/Invalid? | [
"Invalid"
] | [
"Valid",
"Invalid"
] | [
0,
1
] | 151 |
Determine whether the given sequence of parentheses is properly matched.
Sequence: ( ) { } [ ] [ [ ] ( { { } } ) ] ( ) ( )
Valid/Invalid? | [
"Valid"
] | [
"Valid",
"Invalid"
] | [
1,
0
] | 525 |
Determine whether the given sequence of parentheses is properly matched.
Sequence: { ] [ [
Valid/Invalid? | [
"Invalid"
] | [
"Valid",
"Invalid"
] | [
0,
1
] | 131 |
Determine whether the given sequence of parentheses is properly matched.
Sequence: } { [ } } } ) [ } (
Valid/Invalid? | [
"Invalid"
] | [
"Valid",
"Invalid"
] | [
0,
1
] | 186 |
Given two strings, determine the length of the longest common subsequence.
Strings: YJJSMGVGRIDLAZLHIYXAQU ABSWSEEWAFBXEJRALSXYIEAMS
Length of longest common subsequence: | [
"6"
] | [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8",
"9"
] | [
0,
0,
0,
0,
0,
0,
1,
0,
0,
0
] | 28 |
Determine whether the given sequence of parentheses is properly matched.
Sequence: ( ] { } [ ] [ [ ( ) ] ] { } [ ( } { } ]
Valid/Invalid? | [
"Invalid"
] | [
"Valid",
"Invalid"
] | [
0,
1
] | 648 |
Determine whether the given sequence of parentheses is properly matched.
Sequence: ( [
Valid/Invalid? | [
"Invalid"
] | [
"Valid",
"Invalid"
] | [
0,
1
] | 355 |
Determine whether the given sequence of parentheses is properly matched.
Sequence: { [ ] { ( { [ [ [ { { } } ] ] ] } ) } }
Valid/Invalid? | [
"Valid"
] | [
"Valid",
"Invalid"
] | [
1,
0
] | 241 |
Determine whether the given sequence of parentheses is properly matched.
Sequence: [ ] } } } } [ } ) ( ) ) ) { } ) [ } [ (
Valid/Invalid? | [
"Invalid"
] | [
"Valid",
"Invalid"
] | [
0,
1
] | 50 |
Determine whether the given sequence of parentheses is properly matched.
Sequence: [ { } ( ) ] { ( ) }
Valid/Invalid? | [
"Valid"
] | [
"Valid",
"Invalid"
] | [
1,
0
] | 130 |
Determine whether the given sequence of parentheses is properly matched.
Sequence: { } ( ( { [ } } ) )
Valid/Invalid? | [
"Invalid"
] | [
"Valid",
"Invalid"
] | [
0,
1
] | 87 |
Determine whether the given sequence of parentheses is properly matched.
Sequence: ( ) ( [ ] ( [ ( ) ] { ] ) ) [ ] ( ) ( )
Valid/Invalid? | [
"Invalid"
] | [
"Valid",
"Invalid"
] | [
0,
1
] | 348 |
Determine whether the given sequence of parentheses is properly matched.
Sequence: ( ) [ ] ) ( ) ( ( [ ] [ { [ { } ] } ] )
Valid/Invalid? | [
"Invalid"
] | [
"Valid",
"Invalid"
] | [
0,
1
] | 249 |
Determine whether the given sequence of parentheses is properly matched.
Sequence: [ ] [ ] ( ) { } [ [ ] ] ( [ [ ] ( ) ] )
Valid/Invalid? | [
"Valid"
] | [
"Valid",
"Invalid"
] | [
1,
0
] | 188 |
Determine whether the given sequence of parentheses is properly matched.
Sequence: [ ] ) ( { } [ ] { } ( ) { [ } { [ ] } }
Valid/Invalid? | [
"Invalid"
] | [
"Valid",
"Invalid"
] | [
0,
1
] | 4 |
Determine whether the given sequence of parentheses is properly matched.
Sequence: { } { [
Valid/Invalid? | [
"Invalid"
] | [
"Valid",
"Invalid"
] | [
0,
1
] | 548 |
Given two strings, determine the length of the longest common subsequence.
Strings: ZTYIWDRKFTAY HNZV
Length of longest common subsequence: | [
"1"
] | [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8",
"9"
] | [
0,
1,
0,
0,
0,
0,
0,
0,
0,
0
] | 35 |
Determine whether the given sequence of parentheses is properly matched.
Sequence: { ) [ ]
Valid/Invalid? | [
"Invalid"
] | [
"Valid",
"Invalid"
] | [
0,
1
] | 708 |
Determine whether the given sequence of parentheses is properly matched.
Sequence: ( ( { } ] ] ) } { )
Valid/Invalid? | [
"Invalid"
] | [
"Valid",
"Invalid"
] | [
0,
1
] | 534 |
Determine whether the given sequence of parentheses is properly matched.
Sequence: ) ( ) } [ { [ { } ]
Valid/Invalid? | [
"Invalid"
] | [
"Valid",
"Invalid"
] | [
0,
1
] | 71 |
Given two strings, determine the length of the longest common subsequence.
Strings: ZNQKNXIHMPRXGQHIJGBJPW JKINUIUWRJCO
Length of longest common subsequence: | [
"5"
] | [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8",
"9"
] | [
0,
0,
0,
0,
0,
1,
0,
0,
0,
0
] | 188 |
Determine whether the given sequence of parentheses is properly matched.
Sequence: ) } } { [ ) ) [ ] [
Valid/Invalid? | [
"Invalid"
] | [
"Valid",
"Invalid"
] | [
0,
1
] | 394 |
Determine whether the given sequence of parentheses is properly matched.
Sequence: ( [ { } ( ( ) ) ] )
Valid/Invalid? | [
"Valid"
] | [
"Valid",
"Invalid"
] | [
1,
0
] | 416 |
Determine whether the given sequence of parentheses is properly matched.
Sequence: } } } ) [ } { } { [
Valid/Invalid? | [
"Invalid"
] | [
"Valid",
"Invalid"
] | [
0,
1
] | 175 |
Given two strings, determine the length of the longest common subsequence.
Strings: BYUW EXOPAWZ
Length of longest common subsequence: | [
"1"
] | [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8",
"9"
] | [
0,
1,
0,
0,
0,
0,
0,
0,
0,
0
] | 49 |
Determine whether the given sequence of parentheses is properly matched.
Sequence: { [ ] } [ ( ) ] { }
Valid/Invalid? | [
"Valid"
] | [
"Valid",
"Invalid"
] | [
1,
0
] | 566 |
Given two strings, determine the length of the longest common subsequence.
Strings: HAWBXROVHUFNLRQMQOBDNOU EPMFOTOXWGWXDFLWRDQFCHJNYDDHF
Length of longest common subsequence: | [
"7"
] | [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8",
"9"
] | [
0,
0,
0,
0,
0,
0,
0,
1,
0,
0
] | 112 |
Determine whether the given sequence of parentheses is properly matched.
Sequence: [ ] { } ( ) [ ] ( )
Valid/Invalid? | [
"Valid"
] | [
"Valid",
"Invalid"
] | [
1,
0
] | 332 |
Given two strings, determine the length of the longest common subsequence.
Strings: XWSCOLDPOLGRBKYCRUMR RHWQVDTRGOWMAKRUFNYRLHTZXOVXLD
Length of longest common subsequence: | [
"7"
] | [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8",
"9"
] | [
0,
0,
0,
0,
0,
0,
0,
1,
0,
0
] | 186 |
Given two strings, determine the length of the longest common subsequence.
Strings: KUEMWKG KMXGTZPRWCVZYHHVWUDQFJRBIOUVSDU
Length of longest common subsequence: | [
"3"
] | [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8",
"9"
] | [
0,
0,
0,
1,
0,
0,
0,
0,
0,
0
] | 48 |
Given two strings, determine the length of the longest common subsequence.
Strings: YMOAVCDYFGWHSHIPFSVLJOEN AEVENRFVRSHXBFITCOBZMEAPOXMNSB
Length of longest common subsequence: | [
"9"
] | [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8",
"9"
] | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
1
] | 12 |
Given two strings, determine the length of the longest common subsequence.
Strings: KXQVNDHWCECXJPYGJVOHPWG XQUZQQNNALLPJVWECQQ
Length of longest common subsequence: | [
"7"
] | [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8",
"9"
] | [
0,
0,
0,
0,
0,
0,
0,
1,
0,
0
] | 246 |
Given two strings, determine the length of the longest common subsequence.
Strings: OZFLBLWIZSVBVIXYKFEIZQWBIBZPQ GGADZAMFTHTNPUMMSYKMTJRYVD
Length of longest common subsequence: | [
"5"
] | [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8",
"9"
] | [
0,
0,
0,
0,
0,
1,
0,
0,
0,
0
] | 149 |
Determine whether the given sequence of parentheses is properly matched.
Sequence: ) } { ) [ { ] } { }
Valid/Invalid? | [
"Invalid"
] | [
"Valid",
"Invalid"
] | [
0,
1
] | 33 |
Determine whether the given sequence of parentheses is properly matched.
Sequence: [ ] [ ] ( [ ] ( ) ) [ ] [ ] { } ( ( ) )
Valid/Invalid? | [
"Valid"
] | [
"Valid",
"Invalid"
] | [
1,
0
] | 99 |
Determine whether the given sequence of parentheses is properly matched.
Sequence: { } ( ( ) [ ] ) ( [ { { { } } } ( ) ] )
Valid/Invalid? | [
"Valid"
] | [
"Valid",
"Invalid"
] | [
1,
0
] | 448 |
Determine whether the given sequence of parentheses is properly matched.
Sequence: ( } { } } } ) [ { ) { } ] ) ) ( } ( } }
Valid/Invalid? | [
"Invalid"
] | [
"Valid",
"Invalid"
] | [
0,
1
] | 535 |
Determine whether the given sequence of parentheses is properly matched.
Sequence: { } ( [ ] } { } ( )
Valid/Invalid? | [
"Invalid"
] | [
"Valid",
"Invalid"
] | [
0,
1
] | 120 |
Determine whether the given sequence of parentheses is properly matched.
Sequence: [ { [ ] [ ( { ( ) { } ( ) } ) ] } [ ] ]
Valid/Invalid? | [
"Valid"
] | [
"Valid",
"Invalid"
] | [
1,
0
] | 59 |
Determine whether the given sequence of parentheses is properly matched.
Sequence: { } ( { } ( [ { [ ]
Valid/Invalid? | [
"Invalid"
] | [
"Valid",
"Invalid"
] | [
0,
1
] | 125 |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 14