Tasks Details
hard
1.
LetterCover
Given two strings P and Q, find the minimum number of distinct letters in a string constructed by selecting, for each position, a letter from either P or Q.
Task Score
100%
Correctness
100%
Performance
100%
We are given two strings P and Q, each consisting of N lowercase English letters. For each position in the strings, we have to choose one letter from either P or Q, in order to construct a new string S, such that the number of distinct letters in S is minimal. Our task is to find the number of distinct letters in the resulting string S.
For example, if P = "ca" and Q = "ab", S can be equal to: "ca", "cb", "aa" or "ab". String "aa" has only one distinct letter ('a'), so the answer is 1 (which is minimal among those strings).
Write a function:
function solution(P, Q);
that, given two strings P and Q, both of length N, returns the minimum number of distinct letters of a string S, that can be constructed from P and Q as described above.
Examples:
1. Given P = "abc", Q = "bcd", your function should return 2. All possible strings S that can be constructed are: "abc", "abd", "acc", "acd", "bbc", "bbd", "bcc", "bcd". The minimum number of distinct letters is 2, which be obtained by constructing the following strings: "acc", "bbc", "bbd", "bcc".
2. Given P = "axxz", Q = "yzwy", your function should return 2. String S must consist of at least two distinct letters in this case. We can construct S = "yxxy", where the number of distinct letters is equal to 2, and this is the only optimal solution.
3. Given P = "bacad", Q = "abada", your function should return 1. We can choose the letter 'a' in each position, so S can be equal to "aaaaa".
4. Given P = "amz", Q = "amz", your function should return 3. The input strings are identical, so the only possible S that can be constructed is "amz", and its number of distinct letters is 3.
Write an efficient algorithm for the following assumptions:
- N is an integer within the range [1..200,000];
- strings P and Q are both of length N;
- strings P and Q are made only of lowercase letters (a−z);
- strings P and Q contain a total of at most 20 distinct letters.
Copyright 2009–2025 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.
Solution
Programming language used JavaScript
Time spent on task 108 minutes
Notes
not defined yet
Code: 14:48:36 UTC,
java,
autosave
Code: 14:49:04 UTC,
js,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(P, Q) {
for(let i=0; i<length; i++){
letterMap[i]= [P[i], Q[i]]
}
let numOfDistinct = [];
backtrack([],0)
return numOfDistinct.sort((a,b) => a-b)[0]
function backtrack(arr, index){
if(arr.length === length){
let set = new Set(arr)
numOfDistinct.push(set.size)
return
}
for(let letter of letterMap[index]){
arr.push(letter)
backtrack(arr, index + 1)
arr.pop()
}
}
}
Analysis
expand all
Example tests
1.
0.056 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
ReferenceError: length is not defined
at solution (solution.js:5:20)
at solutionWrapper (/tmp/exec_user_tu45t3cp/exec.js:396:28)
at /tmp/exec_user_tu45t3cp/exec.js:422:24
1.
0.056 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
ReferenceError: length is not defined
at solution (solution.js:5:20)
at solutionWrapper (/tmp/exec_user_tu45t3cp/exec.js:396:28)
at /tmp/exec_user_tu45t3cp/exec.js:422:24
1.
0.056 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
ReferenceError: length is not defined
at solution (solution.js:5:20)
at solutionWrapper (/tmp/exec_user_tu45t3cp/exec.js:396:28)
at /tmp/exec_user_tu45t3cp/exec.js:422:24
1.
0.056 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
ReferenceError: length is not defined
at solution (solution.js:5:20)
at solutionWrapper (/tmp/exec_user_tu45t3cp/exec.js:396:28)
at /tmp/exec_user_tu45t3cp/exec.js:422:24
Code: 14:49:46 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(P, Q) {
for(let i=0; i<length; i++){
letterMap[i]= [P[i], Q[i]]
}
let numOfDistinct = [];
return numOfDistinct.sort((a,b) => a-b)[0]
function backtrack(arr, index){
if(arr.length === length){
let set = new Set(arr)
numOfDistinct.push(set.size)
return
}
for(let letter of letterMap[index]){
arr.push(letter)
backtrack(arr, index + 1)
arr.pop()
}
}
}
Code: 14:50:00 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(P, Q) {
for(let i=0; i<length; i++){
letterMap[i]= [P[i], Q[i]]
}
let numOfDistinct = [];
function backtrack(arr, index){
if(arr.length === length){
let set = new Set(arr)
numOfDistinct.push(set.size)
return
}
for(let letter of letterMap[index]){
arr.push(letter)
backtrack(arr, index + 1)
arr.pop()
}
}
backtrack([],0)
return numOfDistinct.sort((a,b) => a-b)[0]
}
Code: 14:50:04 UTC,
js,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(P, Q) {
for(let i=0; i<length; i++){
letterMap[i]= [P[i], Q[i]]
}
let numOfDistinct = [];
function backtrack(arr, index){
if(arr.length === length){
let set = new Set(arr)
numOfDistinct.push(set.size)
return
}
for(let letter of letterMap[index]){
arr.push(letter)
backtrack(arr, index + 1)
arr.pop()
}
}
backtrack([],0)
return numOfDistinct.sort((a,b) => a-b)[0]
}
Analysis
expand all
Example tests
1.
0.060 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
ReferenceError: length is not defined
at solution (solution.js:5:20)
at solutionWrapper (/tmp/exec_user_6futf4bl/exec.js:396:28)
at /tmp/exec_user_6futf4bl/exec.js:422:24
1.
0.060 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
ReferenceError: length is not defined
at solution (solution.js:5:20)
at solutionWrapper (/tmp/exec_user_6futf4bl/exec.js:396:28)
at /tmp/exec_user_6futf4bl/exec.js:422:24
1.
0.056 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
ReferenceError: length is not defined
at solution (solution.js:5:20)
at solutionWrapper (/tmp/exec_user_6futf4bl/exec.js:396:28)
at /tmp/exec_user_6futf4bl/exec.js:422:24
1.
0.060 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
ReferenceError: length is not defined
at solution (solution.js:5:20)
at solutionWrapper (/tmp/exec_user_6futf4bl/exec.js:396:28)
at /tmp/exec_user_6futf4bl/exec.js:422:24
Code: 14:50:18 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(P, Q) {
for(let i=0; i<length; i++){
letterMap[i]= [P[i], Q[i]]
}
let numOfDistinct = [];
function backtrack(arr, index){
if(arr.length === length){
let set = new Set(arr)
numOfDistinct.push(set.size)
return
}
for(let letter of letterMap[index]){
arr.push(letter)
backtrack(arr, index + 1)
arr.pop()
}
}
backtrack([],0)
console.log();
return numOfDistinct.sort((a,b) => a-b)[0]
}
Code: 14:50:30 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(P, Q) {
for(let i=0; i<length; i++){
letterMap[i]= [P[i], Q[i]]
}
let numOfDistinct = [];
function backtrack(arr, index){
if(arr.length === length){
let set = new Set(arr)
numOfDistinct.push(set.size)
return
}
for(let letter of letterMap[index]){
arr.push(letter)
backtrack(arr, index + 1)
arr.pop()
}
}
backtrack([],0)
console.log(numOfDistinct);
return numOfDistinct.sort((a,b) => a-b)[0]
}
Code: 14:50:33 UTC,
js,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(P, Q) {
for(let i=0; i<length; i++){
letterMap[i]= [P[i], Q[i]]
}
let numOfDistinct = [];
function backtrack(arr, index){
if(arr.length === length){
let set = new Set(arr)
numOfDistinct.push(set.size)
return
}
for(let letter of letterMap[index]){
arr.push(letter)
backtrack(arr, index + 1)
arr.pop()
}
}
backtrack([],0)
console.log(numOfDistinct);
return numOfDistinct.sort((a,b) => a-b)[0]
}
Analysis
expand all
Example tests
1.
0.056 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
ReferenceError: length is not defined
at solution (solution.js:5:20)
at solutionWrapper (/tmp/exec_user_b0vi_nfn/exec.js:396:28)
at /tmp/exec_user_b0vi_nfn/exec.js:422:24
1.
0.056 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
ReferenceError: length is not defined
at solution (solution.js:5:20)
at solutionWrapper (/tmp/exec_user_b0vi_nfn/exec.js:396:28)
at /tmp/exec_user_b0vi_nfn/exec.js:422:24
1.
0.060 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
ReferenceError: length is not defined
at solution (solution.js:5:20)
at solutionWrapper (/tmp/exec_user_b0vi_nfn/exec.js:396:28)
at /tmp/exec_user_b0vi_nfn/exec.js:422:24
1.
0.052 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
ReferenceError: length is not defined
at solution (solution.js:5:20)
at solutionWrapper (/tmp/exec_user_b0vi_nfn/exec.js:396:28)
at /tmp/exec_user_b0vi_nfn/exec.js:422:24
Code: 14:53:01 UTC,
js,
autosave
Code: 14:53:05 UTC,
js,
verify,
result: Failed
Analysis
expand all
Example tests
1.
0.068 s
WRONG ANSWER,
got 4 expected 2
1.
0.072 s
WRONG ANSWER,
got 5 expected 2
1.
0.072 s
WRONG ANSWER,
got 4 expected 1
1.
0.076 s
OK
Code: 14:54:01 UTC,
js,
autosave
Code: 14:54:03 UTC,
js,
verify,
result: Failed
Analysis
expand all
Example tests
1.
0.052 s
WRONG ANSWER,
got 4 expected 2
1.
0.052 s
WRONG ANSWER,
got 5 expected 2
1.
0.052 s
WRONG ANSWER,
got 4 expected 1
1.
0.052 s
OK
Code: 14:54:31 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(P, Q) {
const set = new Set();
for (let i = 0; i < P.length; i++) {
for (let j = 0; j < Q.length; j++) {
set.add(P[i]);
set.add(Q[j]);
}
}
console.log(set);
return set.size;
}
Code: 14:54:31 UTC,
js,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(P, Q) {
const set = new Set();
for (let i = 0; i < P.length; i++) {
for (let j = 0; j < Q.length; j++) {
set.add(P[i]);
set.add(Q[j]);
}
}
console.log(set);
return set.size;
}
Analysis
expand all
Example tests
1.
0.056 s
WRONG ANSWER,
got 4 expected 2
stdout:
Set(4) { 'a', 'b', 'c', 'd' }
1.
0.056 s
WRONG ANSWER,
got 5 expected 2
stdout:
Set(5) { 'a', 'y', 'z', 'w', 'x' }
1.
0.056 s
WRONG ANSWER,
got 4 expected 1
stdout:
Set(4) { 'b', 'a', 'd', 'c' }
1.
0.056 s
OK
stdout:
Set(3) { 'a', 'm', 'z' }
Code: 14:57:34 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(P, Q) {
const combinations = [];
for (let i = 0; i < P.length; i++) {
for (let j = 0; j < Q.length; j++) {
const combination = new Set();
combination.add(P[i]);
combination.add(Q[j]);
combinations.push(combination);
}
}
let minDistinctLetters = Infinity;
for (const combination of combinations) {
const distinctLetters = combination.size;
if (distinctLetters < minDistinctLetters) {
minDistinctLetters = distinctLetters;
}
}
return minDistinctLetters;
}
Code: 14:57:36 UTC,
js,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(P, Q) {
const combinations = [];
for (let i = 0; i < P.length; i++) {
for (let j = 0; j < Q.length; j++) {
const combination = new Set();
combination.add(P[i]);
combination.add(Q[j]);
combinations.push(combination);
}
}
let minDistinctLetters = Infinity;
for (const combination of combinations) {
const distinctLetters = combination.size;
if (distinctLetters < minDistinctLetters) {
minDistinctLetters = distinctLetters;
}
}
return minDistinctLetters;
}
Analysis
expand all
Example tests
1.
0.052 s
WRONG ANSWER,
got 1 expected 2
1.
0.052 s
WRONG ANSWER,
got 1 expected 2
1.
0.052 s
OK
1.
0.052 s
WRONG ANSWER,
got 1 expected 3
Code: 14:58:05 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(P, Q) {
const combinations = [];
for (let i = 0; i < P.length; i++) {
for (let j = 0; j < Q.length; j++) {
const combination = new Set();
combination.add(P[i]);
combination.add(Q[j]);
combinations.push(combination);
}
}
let minDistinctLetters = Infinity;
for (const combination of combinations) {
const distinctLetters = combination.size;
if (distinctLetters < minDistinctLetters) {
minDistinctLetters = distinctLetters;
}
}
conso
return minDistinctLetters;
}
Code: 14:58:14 UTC,
js,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(P, Q) {
const combinations = [];
for (let i = 0; i < P.length; i++) {
for (let j = 0; j < Q.length; j++) {
const combination = new Set();
combination.add(P[i]);
combination.add(Q[j]);
combinations.push(combination);
}
}
let minDistinctLetters = Infinity;
for (const combination of combinations) {
const distinctLetters = combination.size;
if (distinctLetters < minDistinctLetters) {
minDistinctLetters = distinctLetters;
}
}
console.log(combinations);
return minDistinctLetters;
}
Analysis
expand all
Example tests
1.
0.060 s
WRONG ANSWER,
got 1 expected 2
stdout:
[
Set(2) { 'a', 'b' },
Set(2) { 'a', 'c' },
Set(2) { 'a', 'd' },
Set(1) { 'b' },
Set(2) { 'b', 'c' },
Set(2) { 'b', 'd' },
Set(2) { 'c', 'b' },
Set(1) { 'c' },
Set(2) { 'c', 'd' }
]
1.
0.060 s
WRONG ANSWER,
got 1 expected 2
stdout:
[
Set(2) { 'a', 'y' }, Set(2) { 'a', 'z' },
Set(2) { 'a', 'w' }, Set(2) { 'a', 'y' },
Set(2) { 'x', 'y' }, Set(2) { 'x', 'z' },
Set(2) { 'x', 'w' }, Set(2) { 'x', 'y' },
Set(2) { 'x', 'y' }, Set(2) { 'x', 'z' },
Set(2) { 'x', 'w' }, Set(2) { 'x', 'y' },
Set(2) { 'z', 'y' }, Set(1) { 'z' },
Set(2) { 'z', 'w' }, Set(2) { 'z', 'y' }
]
1.
0.060 s
OK
stdout:
[
Set(2) { 'b', 'a' }, Set(1) { 'b' },
Set(2) { 'b', 'a' }, Set(2) { 'b', 'd' },
Set(2) { 'b', 'a' }, Set(1) { 'a' },
Set(2) { 'a', 'b' }, Set(1) { 'a' },
Set(2) { 'a', 'd' }, Set(1) { 'a' },
Set(2) { 'c', 'a' }, Set(2) { 'c', 'b' },
Set(2) { 'c', 'a' }, Set(2) { 'c', 'd' },
Set(2) { 'c', 'a' }, Set(1) { 'a' },
Set(2) { 'a', 'b' }, Set(1) { 'a' },
Set(2) { 'a', 'd' }, Set(1) { 'a' },
Set(2) { 'd', 'a' }, Set(2) { 'd', 'b' },
Set(2) { 'd', 'a' }, Set(1) { 'd' },
Set(2) { 'd', 'a' }
]
1.
0.060 s
WRONG ANSWER,
got 1 expected 3
stdout:
[
Set(1) { 'a' },
Set(2) { 'a', 'm' },
Set(2) { 'a', 'z' },
Set(2) { 'm', 'a' },
Set(1) { 'm' },
Set(2) { 'm', 'z' },
Set(2) { 'z', 'a' },
Set(2) { 'z', 'm' },
Set(1) { 'z' }
]
Code: 15:00:51 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(P, Q) {
const set = new Set();
for (let i = 0; i < P.length; i++) {
for (let j = 0; j < Q.length; j++) {
const combination = P[i] + Q[j];
set.add(combination);
}
}
return set.size;
}
Code: 15:00:52 UTC,
js,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(P, Q) {
const set = new Set();
for (let i = 0; i < P.length; i++) {
for (let j = 0; j < Q.length; j++) {
const combination = P[i] + Q[j];
set.add(combination);
}
}
return set.size;
}
Analysis
expand all
Example tests
1.
0.056 s
WRONG ANSWER,
got 9 expected 2
1.
0.056 s
WRONG ANSWER,
got 9 expected 2
1.
0.052 s
WRONG ANSWER,
got 12 expected 1
1.
0.056 s
WRONG ANSWER,
got 9 expected 3
Code: 15:01:14 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(P, Q) {
const set = new Set();
for (let i = 0; i < P.length; i++) {
for (let j = 0; j < Q.length; j++) {
const combination = P[i] + Q[j];
set.add(combination);
}
}
console.log(set);
return set.size;
}
Code: 15:01:14 UTC,
js,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(P, Q) {
const set = new Set();
for (let i = 0; i < P.length; i++) {
for (let j = 0; j < Q.length; j++) {
const combination = P[i] + Q[j];
set.add(combination);
}
}
console.log(set);
return set.size;
}
Analysis
expand all
Example tests
1.
0.060 s
WRONG ANSWER,
got 9 expected 2
stdout:
Set(9) { 'ab', 'ac', 'ad', 'bb', 'bc', 'bd', 'cb', 'cc', 'cd' }
1.
0.056 s
WRONG ANSWER,
got 9 expected 2
stdout:
Set(9) { 'ay', 'az', 'aw', 'xy', 'xz', 'xw', 'zy', 'zz', 'zw' }
1.
0.060 s
WRONG ANSWER,
got 12 expected 1
stdout:
Set(12) {
'ba',
'bb',
'bd',
'aa',
'ab',
'ad',
'ca',
'cb',
'cd',
'da',
'db',
'dd'
}
1.
0.056 s
WRONG ANSWER,
got 9 expected 3
stdout:
Set(9) { 'aa', 'am', 'az', 'ma', 'mm', 'mz', 'za', 'zm', 'zz' }
Code: 15:03:06 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(P, Q) {
const combinations = generateCombinations(P, Q);
let minDistinctLetters = Infinity;
for (const combination of combinations) {
const distinctLetters = countDistinct(combination);
if (distinctLetters < minDistinctLetters) {
minDistinctLetters = distinctLetters;
}
}
return minDistinctLetters;
}
function generateCombinations(P, Q) {
const combinations = [];
for (let i = 0; i < P.length; i++) {
for (let j = 0; j < Q.length; j++) {
for (let k = 0; k < P.length; k++) {
const combination = P[i] + Q[j] + P[k];
combinations.push(combination);
}
}
}
return combinations;
}
Code: 15:03:36 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(P, Q) {
const combinations = generateCombinations(P, Q);
let minDistinctLetters = Infinity;
for (const combination of combinations) {
const distinctLetters = countDistinct(combination);
if (distinctLetters < minDistinctLetters) {
minDistinctLetters = distinctLetters;
}
}
return minDistinctLetters;
}
function generateCombinations(P, Q) {
const combinations = [];
for (let i = 0; i < P.length; i++) {
for (let j = 0; j < Q.length; j++) {
for (let k = 0; k < P.length; k++) {
const combination = P[i] + Q[j] + P[k];
combinations.push(combination);
}
}
}
return combinations;
}
function countDistinct(str) {
const set = new Set();
for (let i = 0; i < str.length; i++) {
set.add(str[i]);
}
return set.size;
}
Code: 15:03:49 UTC,
js,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(P, Q) {
const combinations = generateCombinations(P, Q);
let minDistinctLetters = Infinity;
for (const combination of combinations) {
const distinctLetters = countDistinct(combination);
if (distinctLetters < minDistinctLetters) {
minDistinctLetters = distinctLetters;
}
}
return minDistinctLetters;
}
function generateCombinations(P, Q) {
const combinations = [];
for (let i = 0; i < P.length; i++) {
for (let j = 0; j < Q.length; j++) {
for (let k = 0; k < P.length; k++) {
const combination = P[i] + Q[j] + P[k];
combinations.push(combination);
}
}
}
return combinations;
}
function countDistinct(str) {
const set = new Set();
for (let i = 0; i < str.length; i++) {
set.add(str[i]);
}
return set.size;
}
Analysis
expand all
Example tests
1.
0.056 s
WRONG ANSWER,
got 1 expected 2
1.
0.056 s
WRONG ANSWER,
got 1 expected 2
1.
0.056 s
OK
1.
0.056 s
WRONG ANSWER,
got 1 expected 3
Code: 15:04:06 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(P, Q) {
const combinations = generateCombinations(P, Q);
let minDistinctLetters = Infinity;
for (const combination of combinations) {
const distinctLetters = countDistinct(combination);
if (distinctLetters < minDistinctLetters) {
minDistinctLetters = distinctLetters;
}
}
return minDistinctLetters;
}
function generateCombinations(P, Q) {
const combinations = [];
for (let i = 0; i < P.length; i++) {
for (let j = 0; j < Q.length; j++) {
for (let k = 0; k < P.length; k++) {
const combination = P[i] + Q[j] + P[k];
combinations.push(combination);
}
}
}
return combinations;
}
function countDistinct(str) {
const set = new Set();
for (let i = 0; i < str.length; i++) {
set.add(str[i]);
}
return set.size;
}
c
Code: 15:04:17 UTC,
js,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(P, Q) {
const combinations = generateCombinations(P, Q);
let minDistinctLetters = Infinity;
for (const combination of combinations) {
const distinctLetters = countDistinct(combination);
if (distinctLetters < minDistinctLetters) {
minDistinctLetters = distinctLetters;
}
}
return minDistinctLetters;
}
function generateCombinations(P, Q) {
const combinations = [];
for (let i = 0; i < P.length; i++) {
for (let j = 0; j < Q.length; j++) {
for (let k = 0; k < P.length; k++) {
const combination = P[i] + Q[j] + P[k];
combinations.push(combination);
}
}
}
return combinations;
}
function countDistinct(str) {
const set = new Set();
for (let i = 0; i < str.length; i++) {
set.add(str[i]);
}
return set.size;
}
console.log(combinations);
Analysis
expand all
Example tests
1.
0.060 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
solution.js:41
console.log(combinations);
^
ReferenceError: combinations is not defined
at solution.js:41:13
at solution.js:47:2
at solution.js:48:2
at Script.runInContext (vm.js:144:12)
at Script.runInNewContext (vm.js:149:17)
at Object.runInNewContext (vm.js:303:38)
at getSolution (/tmp/exec_user_vaq6xxhv/exec.js:386:29)
at /tmp/exec_user_vaq6xxhv/exec.js:420:34
1.
0.056 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
solution.js:41
console.log(combinations);
^
ReferenceError: combinations is not defined
at solution.js:41:13
at solution.js:47:2
at solution.js:48:2
at Script.runInContext (vm.js:144:12)
at Script.runInNewContext (vm.js:149:17)
at Object.runInNewContext (vm.js:303:38)
at getSolution (/tmp/exec_user_vaq6xxhv/exec.js:386:29)
at /tmp/exec_user_vaq6xxhv/exec.js:420:34
1.
0.060 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
solution.js:41
console.log(combinations);
^
ReferenceError: combinations is not defined
at solution.js:41:13
at solution.js:47:2
at solution.js:48:2
at Script.runInContext (vm.js:144:12)
at Script.runInNewContext (vm.js:149:17)
at Object.runInNewContext (vm.js:303:38)
at getSolution (/tmp/exec_user_vaq6xxhv/exec.js:386:29)
at /tmp/exec_user_vaq6xxhv/exec.js:420:34
1.
0.056 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
solution.js:41
console.log(combinations);
^
ReferenceError: combinations is not defined
at solution.js:41:13
at solution.js:47:2
at solution.js:48:2
at Script.runInContext (vm.js:144:12)
at Script.runInNewContext (vm.js:149:17)
at Object.runInNewContext (vm.js:303:38)
at getSolution (/tmp/exec_user_vaq6xxhv/exec.js:386:29)
at /tmp/exec_user_vaq6xxhv/exec.js:420:34
Code: 15:04:30 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(P, Q) {
const combinations = generateCombinations(P, Q);
let minDistinctLetters = Infinity;
for (const combination of combinations) {
const distinctLetters = countDistinct(combination);
if (distinctLetters < minDistinctLetters) {
minDistinctLetters = distinctLetters;
}
}
return minDistinctLetters;
}
function generateCombinations(P, Q) {
const combinations = [];
for (let i = 0; i < P.length; i++) {
for (let j = 0; j < Q.length; j++) {
for (let k = 0; k < P.length; k++) {
const combination = P[i] + Q[j] + P[k];
combinations.push(combination);
}
}
}
return combinations;
}
function countDistinct(str) {
const set = new Set();
for (let i = 0; i < str.length; i++) {
set.add(str[i]);
}
return set.size;
}
Code: 15:04:34 UTC,
js,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(P, Q) {
const combinations = generateCombinations(P, Q);
let minDistinctLetters = Infinity;
for (const combination of combinations) {
const distinctLetters = countDistinct(combination);
if (distinctLetters < minDistinctLetters) {
minDistinctLetters = distinctLetters;
}
}
return minDistinctLetters;
}
function generateCombinations(P, Q) {
const combinations = [];
for (let i = 0; i < P.length; i++) {
for (let j = 0; j < Q.length; j++) {
for (let k = 0; k < P.length; k++) {
const combination = P[i] + Q[j] + P[k];
combinations.push(combination);
}
}
}
console.log(combinations);
return combinations;
}
function countDistinct(str) {
const set = new Set();
for (let i = 0; i < str.length; i++) {
set.add(str[i]);
}
return set.size;
}
Analysis
expand all
Example tests
1.
0.060 s
WRONG ANSWER,
got 1 expected 2
stdout:
[ 'aba', 'abb', 'abc', 'aca', 'acb', 'acc', 'ada', 'adb', 'adc', 'bba', 'bbb', 'bbc', 'bca', 'bcb', 'bcc', 'bda', 'bdb', 'bdc', 'cba', 'cbb', 'cbc', 'cca', 'ccb', 'ccc', 'cda', 'cdb', 'cdc' ]
1.
0.060 s
WRONG ANSWER,
got 1 expected 2
stdout:
[ 'aya', 'ayx', 'ayx', 'ayz', 'aza', 'azx', 'azx', 'azz', 'awa', 'awx', 'awx', 'awz', 'aya', 'ayx', 'ayx', 'ayz', 'xya', 'xyx', 'xyx', 'xyz', 'xza', 'xzx', 'xzx', 'xzz', 'xwa', 'xwx', 'xwx', 'xwz', 'xya', 'xyx', 'xyx', 'xyz', 'xya', 'xyx', 'xyx', 'xyz', 'xza', 'xzx', 'xzx', 'xzz', 'xwa', 'xwx', 'xwx', 'xwz', 'xya', 'xyx', 'xyx', 'xyz', 'zya', 'zyx', 'zyx', 'zyz', 'zza', 'zzx', 'zzx', 'zzz', 'zwa', 'zwx', 'zwx', 'zwz', 'zya', 'zyx', 'zyx', 'zyz' ]
1.
0.060 s
OK
stdout:
[ 'bab', 'baa', 'bac', 'baa', 'bad', 'bbb', 'bba', 'bbc', 'bba', 'bbd', 'bab', 'baa', 'bac', 'baa', 'bad', 'bdb', 'bda', 'bdc', 'bda', 'bdd', 'bab', 'baa', 'bac', 'baa', 'bad', 'aab', 'aaa', 'aac', 'aaa', 'aad', 'abb', 'aba', 'abc', 'aba', 'abd', 'aab', 'aaa', 'aac', 'aaa', 'aad', 'adb', 'ada', 'adc', 'ada', 'add', 'aab', 'aaa', 'aac', 'aaa', 'aad', 'cab', 'caa', 'cac', 'caa', 'cad', 'cbb', 'cba', 'cbc', 'cba', 'cbd', 'cab', 'caa', 'cac', 'caa', 'cad', 'cdb', 'cda', 'cdc', 'cda', 'cdd', 'cab', 'caa', 'cac', 'caa', 'cad', 'aab', 'aaa', 'aac', 'aaa', 'aad', 'abb', 'aba', 'abc', 'aba', 'abd', 'aab', 'aaa', 'aac', 'aaa', 'aad', 'adb', 'ada', 'adc', 'ada', 'add', 'aab', 'aaa', 'aac', 'aaa', 'aad', ... 25 more items ]
1.
0.060 s
WRONG ANSWER,
got 1 expected 3
stdout:
[ 'aaa', 'aam', 'aaz', 'ama', 'amm', 'amz', 'aza', 'azm', 'azz', 'maa', 'mam', 'maz', 'mma', 'mmm', 'mmz', 'mza', 'mzm', 'mzz', 'zaa', 'zam', 'zaz', 'zma', 'zmm', 'zmz', 'zza', 'zzm', 'zzz' ]
Code: 15:17:08 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(P, Q) {
const combinations = generateCombinations(P, Q, '', 0, 0);
let minDistinctLetters = Infinity;
for (const combination of combinations) {
const distinctLetters = countDistinct(combination);
if (distinctLetters < minDistinctLetters) {
minDistinctLetters = distinctLetters;
}
}
return minDistinctLetters;
}
function generateCombinations(P, Q, combination, pIndex, qIndex) {
if (combination.length === P.length) {
return [combination];
}
const combinations = [];
if (pIndex < P.length) {
const newCombinationP = combination + P[pIndex];
const subCombinationsP = generateCombinations(P, Q, newCombinationP, pIndex + 1, qIndex);
combinations.push(...subCombinationsP);
}
if (qIndex < Q.length) {
const newCombinationQ = combination + Q[qIndex];
const subCombinationsQ = generateCombinations(P, Q, newCombinationQ, pIndex, qIndex + 1);
combinations.push(...subCombinationsQ);
}
return combinations;
}
Code: 15:17:15 UTC,
js,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(P, Q) {
const combinations = generateCombinations(P, Q, '', 0, 0);
let minDistinctLetters = Infinity;
for (const combination of combinations) {
const distinctLetters = countDistinct(combination);
if (distinctLetters < minDistinctLetters) {
minDistinctLetters = distinctLetters;
}
}
return minDistinctLetters;
}
function generateCombinations(P, Q, combination, pIndex, qIndex) {
if (combination.length === P.length) {
return [combination];
}
const combinations = [];
if (pIndex < P.length) {
const newCombinationP = combination + P[pIndex];
const subCombinationsP = generateCombinations(P, Q, newCombinationP, pIndex + 1, qIndex);
combinations.push(...subCombinationsP);
}
if (qIndex < Q.length) {
const newCombinationQ = combination + Q[qIndex];
const subCombinationsQ = generateCombinations(P, Q, newCombinationQ, pIndex, qIndex + 1);
combinations.push(...subCombinationsQ);
}
return combinations;
}
Analysis
expand all
Example tests
1.
0.056 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
ReferenceError: countDistinct is not defined
at solution (solution.js:9:29)
at solutionWrapper (/tmp/exec_user_4cif5y42/exec.js:396:28)
at /tmp/exec_user_4cif5y42/exec.js:422:24
1.
0.056 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
ReferenceError: countDistinct is not defined
at solution (solution.js:9:29)
at solutionWrapper (/tmp/exec_user_4cif5y42/exec.js:396:28)
at /tmp/exec_user_4cif5y42/exec.js:422:24
1.
0.052 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
ReferenceError: countDistinct is not defined
at solution (solution.js:9:29)
at solutionWrapper (/tmp/exec_user_4cif5y42/exec.js:396:28)
at /tmp/exec_user_4cif5y42/exec.js:422:24
1.
0.056 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
ReferenceError: countDistinct is not defined
at solution (solution.js:9:29)
at solutionWrapper (/tmp/exec_user_4cif5y42/exec.js:396:28)
at /tmp/exec_user_4cif5y42/exec.js:422:24
Code: 15:17:37 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(P, Q) {
const combinations = generateCombinations(P, Q, '', 0, 0);
let minDistinctLetters = Infinity;
for (const combination of combinations) {
const distinctLetters = countDistinct(combination);
if (distinctLetters < minDistinctLetters) {
minDistinctLetters = distinctLetters;
}
}
return minDistinctLetters;
}
function generateCombinations(P, Q, combination, pIndex, qIndex) {
if (combination.length === P.length) {
return [combination];
}
const combinations = [];
if (pIndex < P.length) {
const newCombinationP = combination + P[pIndex];
const subCombinationsP = generateCombinations(P, Q, newCombinationP, pIndex + 1, qIndex);
combinations.push(...subCombinationsP);
}
if (qIndex < Q.length) {
const newCombinationQ = combination + Q[qIndex];
const subCombinationsQ = generateCombinations(P, Q, newCombinationQ, pIndex, qIndex + 1);
combinations.push(...subCombinationsQ);
}
return combinations;
}
Code: 15:18:07 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(P, Q) {
const combinations = generateCombinations(P, Q, '', 0, 0);
let minDistinctLetters = Infinity;
for (const combination of combinations) {
const distinctLetters = countDistinct(combination);
if (distinctLetters < minDistinctLetters) {
minDistinctLetters = distinctLetters;
}
}
return minDistinctLetters;
}
function generateCombinations(P, Q, combination, pIndex, qIndex) {
if (combination.length === P.length) {
return [combination];
}
const combinations = [];
if (pIndex < P.length) {
const newCombinationP = combination + P[pIndex];
const subCombinationsP = generateCombinations(P, Q, newCombinationP, pIndex + 1, qIndex);
combinations.push(...subCombinationsP);
}
if (qIndex < Q.length) {
const newCombinationQ = combination + Q[qIndex];
const subCombinationsQ = generateCombinations(P, Q, newCombinationQ, pIndex, qIndex + 1);
combinations.push(...subCombinationsQ);
}
return combinations;
}
Code: 15:18:14 UTC,
js,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(P, Q) {
const combinations = generateCombinations(P, Q, '', 0, 0);
let minDistinctLetters = Infinity;
for (const combination of combinations) {
const distinctLetters = countDistinct(combination);
if (distinctLetters < minDistinctLetters) {
minDistinctLetters = distinctLetters;
}
}
return minDistinctLetters;
}
function generateCombinations(P, Q, combination, pIndex, qIndex) {
if (combination.length === P.length) {
return [combination];
}
const combinations = [];
if (pIndex < P.length) {
const newCombinationP = combination + P[pIndex];
const subCombinationsP = generateCombinations(P, Q, newCombinationP, pIndex + 1, qIndex);
combinations.push(...subCombinationsP);
}
if (qIndex < Q.length) {
const newCombinationQ = combination + Q[qIndex];
const subCombinationsQ = generateCombinations(P, Q, newCombinationQ, pIndex, qIndex + 1);
combinations.push(...subCombinationsQ);
}
const set = new Set();
for (let i = 0; i < str.length; i++) {
set.add(str[i]);
}
return set.size;
}
Analysis
expand all
Example tests
1.
0.056 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
ReferenceError: str is not defined
at generateCombinations (solution.js:38:23)
at generateCombinations (solution.js:27:30)
at generateCombinations (solution.js:27:30)
at solution (solution.js:5:26)
at solutionWrapper (/tmp/exec_user_vs8nlzs6/exec.js:396:28)
at /tmp/exec_user_vs8nlzs6/exec.js:422:24
1.
0.052 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
ReferenceError: str is not defined
at generateCombinations (solution.js:38:23)
at generateCombinations (solution.js:27:30)
at generateCombinations (solution.js:27:30)
at generateCombinations (solution.js:27:30)
at solution (solution.js:5:26)
at solutionWrapper (/tmp/exec_user_vs8nlzs6/exec.js:396:28)
at /tmp/exec_user_vs8nlzs6/exec.js:422:24
1.
0.060 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
ReferenceError: str is not defined
at generateCombinations (solution.js:38:23)
at generateCombinations (solution.js:27:30)
at generateCombinations (solution.js:27:30)
at generateCombinations (solution.js:27:30)
at generateCombinations (solution.js:27:30)
at solution (solution.js:5:26)
at solutionWrapper (/tmp/exec_user_vs8nlzs6/exec.js:396:28)
at /tmp/exec_user_vs8nlzs6/exec.js:422:24
1.
0.056 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
ReferenceError: str is not defined
at generateCombinations (solution.js:38:23)
at generateCombinations (solution.js:27:30)
at generateCombinations (solution.js:27:30)
at solution (solution.js:5:26)
at solutionWrapper (/tmp/exec_user_vs8nlzs6/exec.js:396:28)
at /tmp/exec_user_vs8nlzs6/exec.js:422:24
Code: 15:18:28 UTC,
js,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(P, Q) {
const combinations = generateCombinations(P, Q, '', 0, 0);
let minDistinctLetters = Infinity;
for (const combination of combinations) {
const distinctLetters = countDistinct(combination);
if (distinctLetters < minDistinctLetters) {
minDistinctLetters = distinctLetters;
}
}
return minDistinctLetters;
}
function generateCombinations(P, Q, combination, pIndex, qIndex) {
if (combination.length === P.length) {
return [combination];
}
const combinations = [];
if (pIndex < P.length) {
const newCombinationP = combination + P[pIndex];
const subCombinationsP = generateCombinations(P, Q, newCombinationP, pIndex + 1, qIndex);
combinations.push(...subCombinationsP);
}
if (qIndex < Q.length) {
const newCombinationQ = combination + Q[qIndex];
const subCombinationsQ = generateCombinations(P, Q, newCombinationQ, pIndex, qIndex + 1);
combinations.push(...subCombinationsQ);
}
return combinations;
}
const set = new Set();
for (let i = 0; i < str.length; i++) {
set.add(str[i]);
}
return set.size;
Analysis
expand all
Example tests
1.
0.056 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
solution.js:41
for (let i = 0; i < str.length; i++) {
^
ReferenceError: str is not defined
at solution.js:41:23
at solution.js:50:2
at solution.js:51:2
at Script.runInContext (vm.js:144:12)
at Script.runInNewContext (vm.js:149:17)
at Object.runInNewContext (vm.js:303:38)
at getSolution (/tmp/exec_user_rfvddps9/exec.js:386:29)
at /tmp/exec_user_rfvddps9/exec.js:420:34
1.
0.056 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
solution.js:41
for (let i = 0; i < str.length; i++) {
^
ReferenceError: str is not defined
at solution.js:41:23
at solution.js:50:2
at solution.js:51:2
at Script.runInContext (vm.js:144:12)
at Script.runInNewContext (vm.js:149:17)
at Object.runInNewContext (vm.js:303:38)
at getSolution (/tmp/exec_user_rfvddps9/exec.js:386:29)
at /tmp/exec_user_rfvddps9/exec.js:420:34
1.
0.052 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
solution.js:41
for (let i = 0; i < str.length; i++) {
^
ReferenceError: str is not defined
at solution.js:41:23
at solution.js:50:2
at solution.js:51:2
at Script.runInContext (vm.js:144:12)
at Script.runInNewContext (vm.js:149:17)
at Object.runInNewContext (vm.js:303:38)
at getSolution (/tmp/exec_user_rfvddps9/exec.js:386:29)
at /tmp/exec_user_rfvddps9/exec.js:420:34
1.
0.056 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
solution.js:41
for (let i = 0; i < str.length; i++) {
^
ReferenceError: str is not defined
at solution.js:41:23
at solution.js:50:2
at solution.js:51:2
at Script.runInContext (vm.js:144:12)
at Script.runInNewContext (vm.js:149:17)
at Object.runInNewContext (vm.js:303:38)
at getSolution (/tmp/exec_user_rfvddps9/exec.js:386:29)
at /tmp/exec_user_rfvddps9/exec.js:420:34
Code: 15:21:32 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(P, Q) {
const combinations = generateCombinations(P, Q, '', 0, 0);
let minDistinctLetters = Infinity;
for (const combination of combinations) {
const distinctLetters = countDistinct(combination);
if (distinctLetters < minDistinctLetters) {
minDistinctLetters = distinctLetters;
}
}
return minDistinctLetters;
}
function generateCombinations(P, Q, combination, pIndex, qIndex) {
if (combination.length === P.length) {
return [combination];
}
const combinations = [];
if (pIndex < P.length) {
const newCombinationP = combination + P[pIndex];
const subCombinationsP = generateCombinations(P, Q, newCombinationP, pIndex + 1, qIndex);
combinations.push(...subCombinationsP);
}
if (qIndex < Q.length) {
const newCombinationQ = combination + Q[qIndex];
const subCombinationsQ = generateCombinations(P, Q, newCombinationQ, pIndex, qIndex + 1);
combinations.push(...subCombinationsQ);
}
return combinations;
Code: 15:21:42 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(P, Q) {
const combinations = generateCombinations(P, Q, '', 0, 0);
let minDistinctLetters = Infinity;
for (const combination of combinations) {
const distinctLetters = countDistinct(combination);
if (distinctLetters < minDistinctLetters) {
minDistinctLetters = distinctLetters;
}
}
return minDistinctLetters;
}
function generateCombinations(P, Q, combination, pIndex, qIndex) {
if (combination.length === P.length) {
return [combination];
}
const combinations = [];
if (pIndex < P.length) {
const newCombinationP = combination + P[pIndex];
const subCombinationsP = generateCombinations(P, Q, newCombinationP, pIndex + 1, qIndex);
combinations.push(...subCombinationsP);
}
if (qIndex < Q.length) {
const newCombinationQ = combination + Q[qIndex];
const subCombinationsQ = generateCombinations(P, Q, newCombinationQ, pIndex, qIndex + 1);
combinations.push(...subCombinationsQ);
}
return combinations;
}
Code: 15:21:56 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(P, Q) {
const combinations = generateCombinations(P, Q, '', 0, 0);
let minDistinctLetters = Infinity;
for (const combination of combinations) {
const distinctLetters = countDistinct(combination);
if (distinctLetters < minDistinctLetters) {
minDistinctLetters = distinctLetters;
}
}
return minDistinctLetters;
}
function generateCombinations(P, Q, combination, pIndex, qIndex) {
if (combination.length === P.length) {
return [combination];
}
const combinations = [];
if (pIndex < P.length) {
const newCombinationP = combination + P[pIndex];
const subCombinationsP = generateCombinations(P, Q, newCombinationP, pIndex + 1, qIndex);
combinations.push(...subCombinationsP);
}
if (qIndex < Q.length) {
const newCombinationQ = combination + Q[qIndex];
const subCombinationsQ = generateCombinations(P, Q, newCombinationQ, pIndex, qIndex + 1);
combinations.push(...subCombinationsQ);
}
return combinations;
}
function countDistinct(str) {
let distinctCount = 0;
const charCount = {};
for (let i = 0; i < str.length; i++) {
const char = str[i];
if (!charCount[char]) {
charCount[char] = true;
distinctCount++;
}
}
return distinctCount;
}
Code: 15:23:11 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(P, Q) {
const combinations = generateCombinations(P, Q, '', 0, 0);
let minDistinctLetters = Infinity;
for (const combination of combinations) {
const distinctLetters = countDistinct(combination);
if (distinctLetters < minDistinctLetters) {
minDistinctLetters = distinctLetters;
}
}
return minDistinctLetters;
}
function generateCombinations(P, Q, combination, pIndex, qIndex) {
if (combination.length === P.length) {
return [combination];
}
const combinations = [];
if (pIndex < P.length) {
const newCombinationP = combination + P[pIndex];
const subCombinationsP = generateCombinations(P, Q, newCombinationP, pIndex + 1, qIndex);
combinations.push(...subCombinationsP);
}
if (qIndex < Q.length) {
const newCombinationQ = combination + Q[qIndex];
const subCombinationsQ = generateCombinations(P, Q, newCombinationQ, pIndex, qIndex + 1);
combinations.push(...subCombinationsQ);
}
return combinations;
}
Code: 15:23:34 UTC,
js,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(P, Q) {
const combinations = generateCombinations(P, Q, '', 0, 0);
let minDistinctLetters = Infinity;
function countDistinct(str) {
let distinctCount = 0;
const charCount = {};
for (let i = 0; i < str.length; i++) {
const char = str[i];
if (!charCount[char]) {
charCount[char] = true;
distinctCount++;
}
}
return distinctCount;
}
for (const combination of combinations) {
const distinctLetters = countDistinct(combination);
if (distinctLetters < minDistinctLetters) {
minDistinctLetters = distinctLetters;
}
}
return minDistinctLetters;
}
function generateCombinations(P, Q, combination, pIndex, qIndex) {
if (combination.length === P.length) {
return [combination];
}
const combinations = [];
if (pIndex < P.length) {
const newCombinationP = combination + P[pIndex];
const subCombinationsP = generateCombinations(P, Q, newCombinationP, pIndex + 1, qIndex);
combinations.push(...subCombinationsP);
}
if (qIndex < Q.length) {
const newCombinationQ = combination + Q[qIndex];
const subCombinationsQ = generateCombinations(P, Q, newCombinationQ, pIndex, qIndex + 1);
combinations.push(...subCombinationsQ);
}
return combinations;
}
Code: 15:23:41 UTC,
js,
verify,
result: Failed
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(P, Q) {
const combinations = generateCombinations(P, Q, '', 0, 0);
let minDistinctLetters = Infinity;
function countDistinct(str) {
let distinctCount = 0;
const charCount = {};
for (let i = 0; i < str.length; i++) {
const char = str[i];
if (!charCount[char]) {
charCount[char] = true;
distinctCount++;
}
}
return distinctCount;
}
for (const combination of combinations) {
const distinctLetters = countDistinct(combination);
if (distinctLetters < minDistinctLetters) {
minDistinctLetters = distinctLetters;
}
}
return minDistinctLetters;
}
function generateCombinations(P, Q, combination, pIndex, qIndex) {
if (combination.length === P.length) {
return [combination];
}
const combinations = [];
if (pIndex < P.length) {
const newCombinationP = combination + P[pIndex];
const subCombinationsP = generateCombinations(P, Q, newCombinationP, pIndex + 1, qIndex);
combinations.push(...subCombinationsP);
}
if (qIndex < Q.length) {
const newCombinationQ = combination + Q[qIndex];
const subCombinationsQ = generateCombinations(P, Q, newCombinationQ, pIndex, qIndex + 1);
combinations.push(...subCombinationsQ);
}
return combinations;
}
Analysis
expand all
Example tests
1.
0.056 s
OK
1.
0.052 s
WRONG ANSWER,
got 3 expected 2
1.
0.052 s
WRONG ANSWER,
got 2 expected 1
1.
0.052 s
WRONG ANSWER,
got 2 expected 3
Code: 15:24:14 UTC,
js,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(P, Q) {
const combinations = generateCombinations(P, Q, '', 0, 0);
let minDistinctLetters = Infinity;
function countDistinct(str) {
let distinctCount = 0;
const charCount = {};
for (let i = 0; i < str.length; i++) {
const char = str[i];
if (!charCount[char]) {
charCount[char] = true;
distinctCount++;
}
}
return distinctCount;
}
for (const combination of combinations) {
const distinctLetters = countDistinct(combination);
if (distinctLetters < minDistinctLetters) {
minDistinctLetters = distinctLetters;
}
}
return minDistinctLetters;
}
function generateCombinations(P, Q, combination, pIndex, qIndex) {
if (combination.length === P.length) {
return [combination];
}
const combinations = [];
if (pIndex < P.length) {
const newCombinationP = combination + P[pIndex];
const subCombinationsP = generateCombinations(P, Q, newCombinationP, pIndex + 1, qIndex);
combinations.push(...subCombinationsP);
}
if (qIndex < Q.length) {
const newCombinationQ = combination + Q[qIndex];
const subCombinationsQ = generateCombinations(P, Q, newCombinationQ, pIndex, qIndex + 1);
combinations.push(...subCombinationsQ);
}
return combinations;
}
Code: 15:24:44 UTC,
js,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(P, Q) {
const combinations = generateCombinations(P, Q, '', 0, 0);
let minDistinctLetters = Infinity;
function countDistinct(str) {
let distinctCount = 0;
const charCount = {};
for (let i = 0; i < str.length; i++) {
const char = str[i];
if (!charCount[char]) {
charCount[char] = true;
distinctCount++;
}
}
console.log("Count Distinct: ", distinctCount)
return distinctCount;
}
for (const combination of combinations) {
const distinctLetters = countDistinct(combination);
if (distinctLetters < minDistinctLetters) {
minDistinctLetters = distinctLetters;
}
}
return minDistinctLetters;
}
function generateCombinations(P, Q, combination, pIndex, qIndex) {
if (combination.length === P.length) {
return [combination];
}
const combinations = [];
if (pIndex < P.length) {
const newCombinationP = combination + P[pIndex];
const subCombinationsP = generateCombinations(P, Q, newCombinationP, pIndex + 1, qIndex);
combinations.push(...subCombinationsP);
}
if (qIndex < Q.length) {
const newCombinationQ = combination + Q[qIndex];
const subCombinationsQ = generateCombinations(P, Q, newCombinationQ, pIndex, qIndex + 1);
combinations.push(...subCombinationsQ);
}
return combinations;
}
Code: 15:24:54 UTC,
js,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(P, Q) {
const combinations = generateCombinations(P, Q, '', 0, 0);
let minDistinctLetters = Infinity;
function countDistinct(str) {
let distinctCount = 0;
const charCount = {};
for (let i = 0; i < str.length; i++) {
const char = str[i];
if (!charCount[char]) {
charCount[char] = true;
distinctCount++;
}
}
console.log("Count Distinct: ", distinctCount);
return distinctCount;
}
for (const combination of combinations) {
const distinctLetters = countDistinct(combination);
if (distinctLetters < minDistinctLetters) {
minDistinctLetters = distinctLetters;
}
}
return minDistinctLetters;
}
function generateCombinations(P, Q, combination, pIndex, qIndex) {
if (combination.length === P.length) {
return [combination];
}
const combinations = [];
if (pIndex < P.length) {
const newCombinationP = combination + P[pIndex];
const subCombinationsP = generateCombinations(P, Q, newCombinationP, pIndex + 1, qIndex);
combinations.push(...subCombinationsP);
}
if (qIndex < Q.length) {
const newCombinationQ = combination + Q[qIndex];
const subCombinationsQ = generateCombinations(P, Q, newCombinationQ, pIndex, qIndex + 1);
combinations.push(...subCombinationsQ);
}
return combinations;
}
Code: 15:25:07 UTC,
js,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(P, Q) {
const combinations = generateCombinations(P, Q, '', 0, 0);
let minDistinctLetters = Infinity;
function countDistinct(str) {
let distinctCount = 0;
const charCount = {};
for (let i = 0; i < str.length; i++) {
const char = str[i];
if (!charCount[char]) {
charCount[char] = true;
distinctCount++;
}
}
console.log("Count Distinct: ", distinctCount);
return distinctCount;
}
for (const combination of combinations) {
const distinctLetters = countDistinct(combination);
if (distinctLetters < minDistinctLetters) {
minDistinctLetters = distinctLetters;
}
}
console.log("");
return minDistinctLetters;
}
function generateCombinations(P, Q, combination, pIndex, qIndex) {
if (combination.length === P.length) {
return [combination];
}
const combinations = [];
if (pIndex < P.length) {
const newCombinationP = combination + P[pIndex];
const subCombinationsP = generateCombinations(P, Q, newCombinationP, pIndex + 1, qIndex);
combinations.push(...subCombinationsP);
}
if (qIndex < Q.length) {
const newCombinationQ = combination + Q[qIndex];
const subCombinationsQ = generateCombinations(P, Q, newCombinationQ, pIndex, qIndex + 1);
combinations.push(...subCombinationsQ);
}
return combinations;
}
Code: 15:25:24 UTC,
js,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(P, Q) {
const combinations = generateCombinations(P, Q, '', 0, 0);
let minDistinctLetters = Infinity;
function countDistinct(str) {
let distinctCount = 0;
const charCount = {};
for (let i = 0; i < str.length; i++) {
const char = str[i];
if (!charCount[char]) {
charCount[char] = true;
distinctCount++;
}
}
console.log("Count Distinct: ", distinctCount);
return distinctCount;
}
for (const combination of combinations) {
const distinctLetters = countDistinct(combination);
if (distinctLetters < minDistinctLetters) {
minDistinctLetters = distinctLetters;
}
}
console.log("Min Distinct Letters: ", minDistinctLetters);
return minDistinctLetters;
}
function generateCombinations(P, Q, combination, pIndex, qIndex) {
if (combination.length === P.length) {
return [combination];
}
const combinations = [];
if (pIndex < P.length) {
const newCombinationP = combination + P[pIndex];
const subCombinationsP = generateCombinations(P, Q, newCombinationP, pIndex + 1, qIndex);
combinations.push(...subCombinationsP);
}
if (qIndex < Q.length) {
const newCombinationQ = combination + Q[qIndex];
const subCombinationsQ = generateCombinations(P, Q, newCombinationQ, pIndex, qIndex + 1);
combinations.push(...subCombinationsQ);
}
return combinations;
}
Code: 15:25:27 UTC,
js,
verify,
result: Failed
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(P, Q) {
const combinations = generateCombinations(P, Q, '', 0, 0);
let minDistinctLetters = Infinity;
function countDistinct(str) {
let distinctCount = 0;
const charCount = {};
for (let i = 0; i < str.length; i++) {
const char = str[i];
if (!charCount[char]) {
charCount[char] = true;
distinctCount++;
}
}
console.log("Count Distinct: ", distinctCount);
return distinctCount;
}
for (const combination of combinations) {
const distinctLetters = countDistinct(combination);
if (distinctLetters < minDistinctLetters) {
minDistinctLetters = distinctLetters;
}
}
console.log("Min Distinct Letters: ", minDistinctLetters);
return minDistinctLetters;
}
function generateCombinations(P, Q, combination, pIndex, qIndex) {
if (combination.length === P.length) {
return [combination];
}
const combinations = [];
if (pIndex < P.length) {
const newCombinationP = combination + P[pIndex];
const subCombinationsP = generateCombinations(P, Q, newCombinationP, pIndex + 1, qIndex);
combinations.push(...subCombinationsP);
}
if (qIndex < Q.length) {
const newCombinationQ = combination + Q[qIndex];
const subCombinationsQ = generateCombinations(P, Q, newCombinationQ, pIndex, qIndex + 1);
combinations.push(...subCombinationsQ);
}
return combinations;
}
Analysis
expand all
Example tests
1.
0.056 s
OK
stdout:
Count Distinct: 3 Count Distinct: 2 Count Distinct: 2 Count Distinct: 3 Count Distinct: 2 Count Distinct: 3 Count Distinct: 3 Count Distinct: 3 Min Distinct Letters: 2
1.
0.056 s
WRONG ANSWER,
got 3 expected 2
stdout:
Count Distinct: 3 Count Distinct: 3 Count Distinct: 3 Count Distinct: 4 Count Distinct: 3 Count Distinct: 4 Count Distinct: 4 Count Distinct: 4 Count Distinct: 3 Count Distinct: 4 Count Distinct: 4 Count Distinct: 4 Count Distinct: 4 Count Distinct: 4 Count Distinct: 4 Count Distinct: 3 Min Distinct Letters: 3
1.
0.056 s
WRONG ANSWER,
got 2 expected 1
stdout:
Count Distinct: 4 Count Distinct: 3 Count Distinct: 3 Count Distinct: 3 Count Distinct: 3 Count Distinct: 3 Count Distinct: 3 Count Distinct: 2 Count Distinct: 3 Count Distinct: 3 Count Distinct: 3 Count Distinct: 2 Count Distinct: 3 Count Distinct: 2 Count Distinct: 2 Count Distinct: 3 Count Distinct: 3 Count Distinct: 3 Count Distinct: 3 Count Distinct: 2 Count Distinct: 3 Count Distinct: 2 Count Distinct: 2 Count Distinct: 3 Count Distinct: 3 Count Distinct: 2 Count Distinct: 2 Count Distinct: 3 Count Distinct: 2 Count Distinct: 3 Count Distinct: 3 Count Distinct: 3 Min Distinct Letters: 2
1.
0.056 s
WRONG ANSWER,
got 2 expected 3
stdout:
Count Distinct: 3 Count Distinct: 2 Count Distinct: 2 Count Distinct: 2 Count Distinct: 2 Count Distinct: 2 Count Distinct: 2 Count Distinct: 3 Min Distinct Letters: 2
Code: 15:42:05 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(P, Q) {
let strings = [P , Q], combination = '', index = 0, result = [];
if (combination.length === 3) {
result.push(combination);
return;
}
const currentString = strings.join('');
for (let i = index; i < currentString.length; i++) {
const newCombination = combination + currentString[i];
generateCombinations(strings, newCombination, i + 1, result);
}
return result;
}
Code: 15:42:36 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(P, Q) {
let strings = [P , Q], combination = '', index = 0, result = [];
if (combination.length === 3) {
result.push(combination);
return;
}
const currentString = strings.join('');
for (let i = index; i < currentString.length; i++) {
const newCombination = combination + currentString[i];
generateCombinations(strings, newCombination, i + 1, result);
}
console.log(result)
return result;
}
Code: 15:42:36 UTC,
js,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(P, Q) {
let strings = [P , Q], combination = '', index = 0, result = [];
if (combination.length === 3) {
result.push(combination);
return;
}
const currentString = strings.join('');
for (let i = index; i < currentString.length; i++) {
const newCombination = combination + currentString[i];
generateCombinations(strings, newCombination, i + 1, result);
}
console.log(result)
return result;
}
Analysis
expand all
Example tests
1.
0.056 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
ReferenceError: generateCombinations is not defined
at solution (solution.js:16:5)
at solutionWrapper (/tmp/exec_user_pz95m2ko/exec.js:396:28)
at /tmp/exec_user_pz95m2ko/exec.js:422:24
1.
0.056 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
ReferenceError: generateCombinations is not defined
at solution (solution.js:16:5)
at solutionWrapper (/tmp/exec_user_pz95m2ko/exec.js:396:28)
at /tmp/exec_user_pz95m2ko/exec.js:422:24
1.
0.060 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
ReferenceError: generateCombinations is not defined
at solution (solution.js:16:5)
at solutionWrapper (/tmp/exec_user_pz95m2ko/exec.js:396:28)
at /tmp/exec_user_pz95m2ko/exec.js:422:24
1.
0.060 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
ReferenceError: generateCombinations is not defined
at solution (solution.js:16:5)
at solutionWrapper (/tmp/exec_user_pz95m2ko/exec.js:396:28)
at /tmp/exec_user_pz95m2ko/exec.js:422:24
Code: 15:42:49 UTC,
js,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(P, Q) {
let strings = [P , Q], combination = '', index = 0, result = [];
if (combination.length === 3) {
result.push(combination);
return;
}
const currentString = strings.join('');
for (let i = index; i < currentString.length; i++) {
const newCombination = combination + currentString[i];
generateCombinations(strings, newCombination, i + 1, result);
}
console.log(result);
return result;
}
Analysis
expand all
Example tests
1.
0.056 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
ReferenceError: generateCombinations is not defined
at solution (solution.js:16:5)
at solutionWrapper (/tmp/exec_user_fkfy0omw/exec.js:396:28)
at /tmp/exec_user_fkfy0omw/exec.js:422:24
1.
0.056 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
ReferenceError: generateCombinations is not defined
at solution (solution.js:16:5)
at solutionWrapper (/tmp/exec_user_fkfy0omw/exec.js:396:28)
at /tmp/exec_user_fkfy0omw/exec.js:422:24
1.
0.056 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
ReferenceError: generateCombinations is not defined
at solution (solution.js:16:5)
at solutionWrapper (/tmp/exec_user_fkfy0omw/exec.js:396:28)
at /tmp/exec_user_fkfy0omw/exec.js:422:24
1.
0.056 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
ReferenceError: generateCombinations is not defined
at solution (solution.js:16:5)
at solutionWrapper (/tmp/exec_user_fkfy0omw/exec.js:396:28)
at /tmp/exec_user_fkfy0omw/exec.js:422:24
Code: 15:43:13 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(P, Q) {
let strings = [P , Q], combination = '', index = 0, result = [];
if (combination.length === 3) {
result.push(combination);
return;
}
const currentString = strings.join('');
for (let i = index; i < currentString.length; i++) {
const newCombination = combination + currentString[i];
solution(strings, newCombination, i + 1, result);
}
console.log(result);
return result;
}
Code: 15:43:14 UTC,
js,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(P, Q) {
let strings = [P , Q], combination = '', index = 0, result = [];
if (combination.length === 3) {
result.push(combination);
return;
}
const currentString = strings.join('');
for (let i = index; i < currentString.length; i++) {
const newCombination = combination + currentString[i];
solution(strings, newCombination, i + 1, result);
}
console.log(result);
return result;
}
Analysis
expand all
Example tests
1.
5.000 s
TIMEOUT ERROR,
Killed. Hard limit reached: 5.000 sec.
1.
5.000 s
TIMEOUT ERROR,
Killed. Hard limit reached: 5.000 sec.
1.
5.000 s
TIMEOUT ERROR,
Killed. Hard limit reached: 5.000 sec.
1.
5.000 s
TIMEOUT ERROR,
Killed. Hard limit reached: 5.000 sec.
Code: 15:45:30 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(P, Q) {
let strings = [P , Q], combination = '', index = 0, result = [];
if (combination.length === 3) {
result.push(combination);
return;
}
const currentString = strings.join('');
for (let i = index; i < currentString.length; i++) {
const newCombination = combination + currentString[i];
generateCombinations(strings, newCombination, i + 1, result);
}
console.log(result);
return result;
}
Code: 15:46:06 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(P, Q) {
let strings = [P , Q], combination = '', index = 0, result = [];
function generateCombinations(strings, combination = '', index = 0, result = []) {
if (combination.length === 3) {
result.push(combination);
return;
}
const currentString = strings.join('');
for (let i = index; i < currentString.length; i++) {
const newCombination = combination + currentString[i];
generateCombinations(strings, newCombination, i + 1, result);
}
return result;
}
return result;
}
Code: 15:46:37 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(P, Q) {
let strings = [P , Q], combination = '', index = 0, result = [];
function generateCombinations(strings, combination = '', index = 0, result = []) {
if (combination.length === 3) {
result.push(combination);
return;
}
const currentString = strings.join('');
for (let i = index; i < currentString.length; i++) {
const newCombination = combination + currentString[i];
generateCombinations(strings, newCombination, i + 1, result);
}
return result;
}
return result;
}
Code: 15:46:48 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(P, Q) {
let strings = [P , Q], combination = '', index = 0, result = [];
function generateCombinations(strings, combination = '', index = 0, result = []) {
if (combination.length === 3) {
result.push(combination);
return;
}
const currentString = strings.join('');
for (let i = index; i < currentString.length; i++) {
const newCombination = combination + currentString[i];
generateCombinations(strings, newCombination, i + 1, result);
}
return result;
}
return result;
}
Code: 15:47:08 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(P, Q) {
let strings = [P , Q], combination = '', index = 0, result = [];
function generateCombinations(strings, combination = '', index = 0, result = []) {
if (combination.length === 3) {
result.push(combination);
return;
}
const currentString = strings.join('');
for (let i = index; i < currentString.length; i++) {
const newCombination = combination + currentString[i];
generateCombinations(strings, newCombination, i + 1, result);
}
return result;
}
return result;
}
Code: 15:47:28 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(P, Q) {
let strings = [P , Q], combination = '', index = 0, result = [];
function generateCombinations(strings, combination = '', index = 0, result = []) {
if (combination.length === 3) {
result.push(combination);
return;
}
const currentString = strings.join('');
for (let i = index; i < currentString.length; i++) {
const newCombination = combination + currentString[i];
generateCombinations(strings, newCombination, i + 1, result);
}
return result;
}
return result;
}
Code: 15:47:46 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(P, Q) {
let strings = [P , Q], combination = '', index = 0, result = [];
function generateCombinations(strings, combination = '', index = 0, result = []) {
if (combination.length === 3) {
result.push(combination);
return;
}
const currentString = strings.join('');
for (let i = index; i < currentString.length; i++) {
const newCombination = combination + currentString[i];
generateCombinations(strings, newCombination, i + 1, result);
}
return result;
}
}
Code: 15:48:08 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(P, Q) {
let strings = [P , Q];
function generateCombinations(strings, combination = '', index = 0, result = []) {
if (combination.length === 3) {
result.push(combination);
return;
}
const currentString = strings.join('');
for (let i = index; i < currentString.length; i++) {
const newCombination = combination + currentString[i];
generateCombinations(strings, newCombination, i + 1, result);
}
return result;
}
}
Code: 15:48:28 UTC,
js,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(P, Q) {
let strings = [P , Q];
function generateCombinations(strings, combination = '', index = 0, result = []) {
if (combination.length === 3) {
result.push(combination);
return;
}
const currentString = strings.join('');
for (let i = index; i < currentString.length; i++) {
const newCombination = combination + currentString[i];
generateCombinations(strings, newCombination, i + 1, result);
}
return result;
}
}
Analysis
expand all
Example tests
1.
0.056 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, integer expected, 'undefined' found Perhaps you are missing a 'return'?
1.
0.056 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, integer expected, 'undefined' found Perhaps you are missing a 'return'?
1.
0.056 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, integer expected, 'undefined' found Perhaps you are missing a 'return'?
1.
0.056 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, integer expected, 'undefined' found Perhaps you are missing a 'return'?
Code: 15:51:06 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(P, Q) {
let strings = [P , Q];
function generateCombinations(strings) {
const combinations = [];
const str1 = strings[0];
const str2 = strings[1];
for (let i = 0; i < str1.length; i++) {
for (let j = 0; j < str2.length; j++) {
for (let k = 0; k < str1.length; k++) {
const combination = str1[i] + str2[j] + str1[k];
combinations.push(combination);
}
}
}
return combinations;
}
}
Code: 15:51:30 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(P, Q) {
function generateCombinations(strings) {
let strings = [P , Q];
const combinations = [];
const str1 = strings[0];
const str2 = strings[1];
for (let i = 0; i < str1.length; i++) {
for (let j = 0; j < str2.length; j++) {
for (let k = 0; k < str1.length; k++) {
const combination = str1[i] + str2[j] + str1[k];
combinations.push(combination);
}
}
}
return combinations;
}
}
Code: 15:51:49 UTC,
js,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(P, Q) {
function generateCombinations(strings) {
strings = [P , Q];
const combinations = [];
const str1 = strings[0];
const str2 = strings[1];
for (let i = 0; i < str1.length; i++) {
for (let j = 0; j < str2.length; j++) {
for (let k = 0; k < str1.length; k++) {
const combination = str1[i] + str2[j] + str1[k];
combinations.push(combination);
}
}
}
console.log(combinations);
return combinations;
}
}
Analysis
expand all
Example tests
1.
0.056 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, integer expected, 'undefined' found Perhaps you are missing a 'return'?
1.
0.056 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, integer expected, 'undefined' found Perhaps you are missing a 'return'?
1.
0.056 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, integer expected, 'undefined' found Perhaps you are missing a 'return'?
1.
0.056 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, integer expected, 'undefined' found Perhaps you are missing a 'return'?
Code: 15:52:13 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(P, Q) {
function generateCombinations(strings) {
strings = [P , Q];
const combinations = [];
const str1 = strings[0];
const str2 = strings[1];
for (let i = 0; i < str1.length; i++) {
for (let j = 0; j < str2.length; j++) {
for (let k = 0; k < str1.length; k++) {
const combination = str1[i] + str2[j] + str1[k];
combinations.push(combination);
}
}
}
console.log(combinations);
}
}
Code: 15:52:16 UTC,
js,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(P, Q) {
function generateCombinations(strings) {
strings = [P , Q];
const combinations = [];
const str1 = strings[0];
const str2 = strings[1];
for (let i = 0; i < str1.length; i++) {
for (let j = 0; j < str2.length; j++) {
for (let k = 0; k < str1.length; k++) {
const combination = str1[i] + str2[j] + str1[k];
combinations.push(combination);
}
}
}
console.log(combinations);
}return combinations;
}
Analysis
expand all
Example tests
1.
0.056 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
ReferenceError: combinations is not defined
at solution (solution.js:23:2)
at solutionWrapper (/tmp/exec_user_dfyz_3v2/exec.js:396:28)
at /tmp/exec_user_dfyz_3v2/exec.js:422:24
1.
0.056 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
ReferenceError: combinations is not defined
at solution (solution.js:23:2)
at solutionWrapper (/tmp/exec_user_dfyz_3v2/exec.js:396:28)
at /tmp/exec_user_dfyz_3v2/exec.js:422:24
1.
0.056 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
ReferenceError: combinations is not defined
at solution (solution.js:23:2)
at solutionWrapper (/tmp/exec_user_dfyz_3v2/exec.js:396:28)
at /tmp/exec_user_dfyz_3v2/exec.js:422:24
1.
0.060 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
ReferenceError: combinations is not defined
at solution (solution.js:23:2)
at solutionWrapper (/tmp/exec_user_dfyz_3v2/exec.js:396:28)
at /tmp/exec_user_dfyz_3v2/exec.js:422:24
Code: 15:52:43 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(P, Q) {
function generateCombinations(strings) {
const combinations = [];
const str1 = strings[0];
const str2 = strings[1];
for (let i = 0; i < str1.length; i++) {
for (let j = 0; j < str2.length; j++) {
for (let k = 0; k < str1.length; k++) {
const combination = str1[i] + str2[j] + str1[k];
combinations.push(combination);
}
}
}
return combinations;
}
}
Code: 15:52:54 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(P, Q) {
function generateCombinations(strings) {
const combinations = [];
const str1 = strings[0];
const str2 = strings[1];
for (let i = 0; i < str1.length; i++) {
for (let j = 0; j < str2.length; j++) {
for (let k = 0; k < str1.length; k++) {
const combination = str1[i] + str2[j] + str1[k];
combinations.push(combination);
}
}
}
return combinations;
}
}
Code: 15:53:08 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(P, Q) {
function generateCombinations(strings) {
const combinations = [];
const str1 = strings[0];
const str2 = strings[1];
for (let i = 0; i < str1.length; i++) {
for (let j = 0; j < str2.length; j++) {
for (let k = 0; k < str1.length; k++) {
const combination = str1[i] + str2[j] + str1[k];
combinations.push(combination);
}
}
}
return combinations;
}
const
generateCombinations()
}
Code: 15:53:30 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(P, Q) {
function generateCombinations(strings) {
const combinations = [];
const str1 = strings[0];
const str2 = strings[1];
for (let i = 0; i < str1.length; i++) {
for (let j = 0; j < str2.length; j++) {
for (let k = 0; k < str1.length; k++) {
const combination = str1[i] + str2[j] + str1[k];
combinations.push(combination);
}
}
}
return combinations;
}
const array = [P,Q];
generateCombinations()
}
Code: 15:53:36 UTC,
js,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(P, Q) {
function generateCombinations(strings) {
const combinations = [];
const str1 = strings[0];
const str2 = strings[1];
for (let i = 0; i < str1.length; i++) {
for (let j = 0; j < str2.length; j++) {
for (let k = 0; k < str1.length; k++) {
const combination = str1[i] + str2[j] + str1[k];
combinations.push(combination);
}
}
}
return combinations;
}
const array = [P,Q];
generateCombinations(array)
}
Analysis
expand all
Example tests
1.
0.056 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, integer expected, 'undefined' found Perhaps you are missing a 'return'?
1.
0.056 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, integer expected, 'undefined' found Perhaps you are missing a 'return'?
1.
0.056 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, integer expected, 'undefined' found Perhaps you are missing a 'return'?
1.
0.052 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, integer expected, 'undefined' found Perhaps you are missing a 'return'?
Code: 15:54:01 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(P, Q) {
function generateCombinations(strings) {
const combinations = [];
const str1 = strings[0];
const str2 = strings[1];
for (let i = 0; i < str1.length; i++) {
for (let j = 0; j < str2.length; j++) {
for (let k = 0; k < str1.length; k++) {
const combination = str1[i] + str2[j] + str1[k];
combinations.push(combination);
}
}
}
return combinations;
}
generateCombinations(array)
}
Code: 15:54:05 UTC,
js,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(P, Q) {
const array = [P,Q];
function generateCombinations(strings) {
const combinations = [];
const str1 = strings[0];
const str2 = strings[1];
for (let i = 0; i < str1.length; i++) {
for (let j = 0; j < str2.length; j++) {
for (let k = 0; k < str1.length; k++) {
const combination = str1[i] + str2[j] + str1[k];
combinations.push(combination);
}
}
}
return combinations;
}
generateCombinations(array)
}
Analysis
expand all
Example tests
1.
0.056 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, integer expected, 'undefined' found Perhaps you are missing a 'return'?
1.
0.056 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, integer expected, 'undefined' found Perhaps you are missing a 'return'?
1.
0.056 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, integer expected, 'undefined' found Perhaps you are missing a 'return'?
1.
0.056 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, integer expected, 'undefined' found Perhaps you are missing a 'return'?
Code: 15:54:16 UTC,
js,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(P, Q) {
const array = [P,Q];
function generateCombinations(strings) {
const combinations = [];
const str1 = strings[0];
const str2 = strings[1];
for (let i = 0; i < str1.length; i++) {
for (let j = 0; j < str2.length; j++) {
for (let k = 0; k < str1.length; k++) {
const combination = str1[i] + str2[j] + str1[k];
combinations.push(combination);
}
}
}
return combinations;
}
return generateCombinations(array)
}
Analysis
expand all
Example tests
1.
0.072 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, integer expected, 'object' found
1.
0.056 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, integer expected, 'object' found
1.
0.064 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, integer expected, 'object' found
1.
0.052 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, integer expected, 'object' found
Code: 15:54:30 UTC,
js,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(P, Q) {
const array = [P,Q];
function generateCombinations(strings) {
const combinations = [];
const str1 = strings[0];
const str2 = strings[1];
for (let i = 0; i < str1.length; i++) {
for (let j = 0; j < str2.length; j++) {
for (let k = 0; k < str1.length; k++) {
const combination = str1[i] + str2[j] + str1[k];
combinations.push(combination);
}
}
}
}
return generateCombinations(array)
}
Analysis
expand all
Example tests
1.
0.056 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, integer expected, 'undefined' found Perhaps you are missing a 'return'?
1.
0.052 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, integer expected, 'undefined' found Perhaps you are missing a 'return'?
1.
0.056 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, integer expected, 'undefined' found Perhaps you are missing a 'return'?
1.
0.052 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, integer expected, 'undefined' found Perhaps you are missing a 'return'?
Code: 15:54:36 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(P, Q) {
const array = [P,Q];
function generateCombinations(strings) {
const combinations = [];
const str1 = strings[0];
const str2 = strings[1];
for (let i = 0; i < str1.length; i++) {
for (let j = 0; j < str2.length; j++) {
for (let k = 0; k < str1.length; k++) {
const combination = str1[i] + str2[j] + str1[k];
combinations.push(combination);
}
}
}
}
return generateCombinations(array);
}
Code: 15:54:46 UTC,
js,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(P, Q) {
const array = [P,Q];
function generateCombinations(strings) {
const combinations = [];
const str1 = strings[0];
const str2 = strings[1];
for (let i = 0; i < str1.length; i++) {
for (let j = 0; j < str2.length; j++) {
for (let k = 0; k < str1.length; k++) {
const combination = str1[i] + str2[j] + str1[k];
combinations.push(combination);
}
}
}
}
generateCombinations(array);
return combinations;
}
Analysis
expand all
Example tests
1.
0.056 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
ReferenceError: combinations is not defined
at solution (solution.js:25:1)
at solutionWrapper (/tmp/exec_user_80x94sqh/exec.js:396:28)
at /tmp/exec_user_80x94sqh/exec.js:422:24
1.
0.056 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
ReferenceError: combinations is not defined
at solution (solution.js:25:1)
at solutionWrapper (/tmp/exec_user_80x94sqh/exec.js:396:28)
at /tmp/exec_user_80x94sqh/exec.js:422:24
1.
0.056 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
ReferenceError: combinations is not defined
at solution (solution.js:25:1)
at solutionWrapper (/tmp/exec_user_80x94sqh/exec.js:396:28)
at /tmp/exec_user_80x94sqh/exec.js:422:24
1.
0.060 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
ReferenceError: combinations is not defined
at solution (solution.js:25:1)
at solutionWrapper (/tmp/exec_user_80x94sqh/exec.js:396:28)
at /tmp/exec_user_80x94sqh/exec.js:422:24
Code: 15:55:13 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(P, Q) {
const array = [P,Q];
function generateCombinations(strings) {
const combinations = [];
const str1 = strings[0];
const str2 = strings[1];
for (let i = 0; i < str1.length; i++) {
for (let j = 0; j < str2.length; j++) {
for (let k = 0; k < str1.length; k++) {
const combination = str1[i] + str2[j] + str1[k];
combinations.push(combination);
}
}
}
}
generateCombinations(array);
return combinations;
}
Code: 15:55:43 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(P, Q) {
const array = [P,Q];
function generateCombinations(strings) {
const combinations = [];
const str1 = strings[0];
const str2 = strings[1];
for (let i = 0; i < str1.length; i++) {
for (let j = 0; j < str2.length; j++) {
for (let k = 0; k < str1.length; k++) {
const combination = str1[i] + str2[j] + str1[k];
combinations.push(combination);
}
}
}
}
generateCombinations(array);
return combinations;
}
Code: 15:56:01 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(P, Q) {
const array = [P,Q];
function generateCombinations(strings) {
const combinations = [];
const str1 = strings[0];
const str2 = strings[1];
for (let i = 0; i < str1.length; i++) {
for (let j = 0; j < str2.length; j++) {
for (let k = 0; k < str1.length; k++) {
const combination = str1[i] + str2[j] + str1[k];
combinations.push(combination);
}
}
}
}
generateCombinations(array);
return combinations;
}
Code: 15:56:20 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(P, Q) {
const array = [P,Q];
function generateCombinations(strings) {
const combinations = [];
const str1 = strings[0];
const str2 = strings[1];
for (let i = 0; i < str1.length; i++) {
for (let j = 0; j < str2.length; j++) {
for (let k = 0; k < str1.length; k++) {
const combination = str1[i] + str2[j] + str1[k];
combinations.push(combination);
}
}
}
}
generateCombinations(array);
}
Code: 15:56:35 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(P, Q) {
const array = [P,Q];
function generateCombinations(strings) {
const combinations = [];
const str1 = strings[0];
const str2 = strings[1];
for (let i = 0; i < str1.length; i++) {
for (let j = 0; j < str2.length; j++) {
for (let k = 0; k < str1.length; k++) {
const combination = str1[i] + str2[j] + str1[k];
combinations.push(combination);
}
}
}
}
}
Code: 15:56:50 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(P, Q) {
const array = [P,Q];
const combinations = [];
const str1 = strings[0];
const str2 = strings[1];
for (let i = 0; i < str1.length; i++) {
for (let j = 0; j < str2.length; j++) {
for (let k = 0; k < str1.length; k++) {
const combination = str1[i] + str2[j] + str1[k];
combinations.push(combination);
}
}
}
}
Code: 15:57:00 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(P, Q) {
const strings = [P,Q];
const combinations = [];
const str1 = strings[0];
const str2 = strings[1];
for (let i = 0; i < str1.length; i++) {
for (let j = 0; j < str2.length; j++) {
for (let k = 0; k < str1.length; k++) {
const combination = str1[i] + str2[j] + str1[k];
combinations.push(combination);
}
}
}
}
Code: 15:57:23 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(P, Q) {
const strings = [P,Q];
const combinations = [];
const str1 = strings[0];
const str2 = strings[1];
for (let i = 0; i < str1.length; i++) {
for (let j = 0; j < str2.length; j++) {
for (let k = 0; k < str1.length; k++) {
const combination = str1[i] + str2[j] + str1[k];
combinations.push(combination);
}
}
}
console.log();
return combinations;
}
Code: 15:57:46 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(P, Q) {
const strings = [P,Q];
const combinations = [];
const str1 = strings[0];
const str2 = strings[1];
for (let i = 0; i < str1.length; i++) {
for (let j = 0; j < str2.length; j++) {
for (let k = 0; k < str1.length; k++) {
const combination = str1[i] + str2[j] + str1[k];
combinations.push(combination);
}
}
}
console.log(combinations);
return combinations;
}
Code: 15:57:48 UTC,
js,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(P, Q) {
const strings = [P,Q];
const combinations = [];
const str1 = strings[0];
const str2 = strings[1];
for (let i = 0; i < str1.length; i++) {
for (let j = 0; j < str2.length; j++) {
for (let k = 0; k < str1.length; k++) {
const combination = str1[i] + str2[j] + str1[k];
combinations.push(combination);
}
}
}
console.log(combinations);
return combinations;
}
Analysis
expand all
Example tests
1.
0.056 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, integer expected, 'object' foundstdout:
[ 'aba', 'abb', 'abc', 'aca', 'acb', 'acc', 'ada', 'adb', 'adc', 'bba', 'bbb', 'bbc', 'bca', 'bcb', 'bcc', 'bda', 'bdb', 'bdc', 'cba', 'cbb', 'cbc', 'cca', 'ccb', 'ccc', 'cda', 'cdb', 'cdc' ]
1.
0.056 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, integer expected, 'object' foundstdout:
[ 'aya', 'ayx', 'ayx', 'ayz', 'aza', 'azx', 'azx', 'azz', 'awa', 'awx', 'awx', 'awz', 'aya', 'ayx', 'ayx', 'ayz', 'xya', 'xyx', 'xyx', 'xyz', 'xza', 'xzx', 'xzx', 'xzz', 'xwa', 'xwx', 'xwx', 'xwz', 'xya', 'xyx', 'xyx', 'xyz', 'xya', 'xyx', 'xyx', 'xyz', 'xza', 'xzx', 'xzx', 'xzz', 'xwa', 'xwx', 'xwx', 'xwz', 'xya', 'xyx', 'xyx', 'xyz', 'zya', 'zyx', 'zyx', 'zyz', 'zza', 'zzx', 'zzx', 'zzz', 'zwa', 'zwx', 'zwx', 'zwz', 'zya', 'zyx', 'zyx', 'zyz' ]
1.
0.060 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, integer expected, 'object' foundstdout:
[ 'bab', 'baa', 'bac', 'baa', 'bad', 'bbb', 'bba', 'bbc', 'bba', 'bbd', 'bab', 'baa', 'bac', 'baa', 'bad', 'bdb', 'bda', 'bdc', 'bda', 'bdd', 'bab', 'baa', 'bac', 'baa', 'bad', 'aab', 'aaa', 'aac', 'aaa', 'aad', 'abb', 'aba', 'abc', 'aba', 'abd', 'aab', 'aaa', 'aac', 'aaa', 'aad', 'adb', 'ada', 'adc', 'ada', 'add', 'aab', 'aaa', 'aac', 'aaa', 'aad', 'cab', 'caa', 'cac', 'caa', 'cad', 'cbb', 'cba', 'cbc', 'cba', 'cbd', 'cab', 'caa', 'cac', 'caa', 'cad', 'cdb', 'cda', 'cdc', 'cda', 'cdd', 'cab', 'caa', 'cac', 'caa', 'cad', 'aab', 'aaa', 'aac', 'aaa', 'aad', 'abb', 'aba', 'abc', 'aba', 'abd', 'aab', 'aaa', 'aac', 'aaa', 'aad', 'adb', 'ada', 'adc', 'ada', 'add', 'aab', 'aaa', 'aac', 'aaa', 'aad', ... 25 more items ]
1.
0.056 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, integer expected, 'object' foundstdout:
[ 'aaa', 'aam', 'aaz', 'ama', 'amm', 'amz', 'aza', 'azm', 'azz', 'maa', 'mam', 'maz', 'mma', 'mmm', 'mmz', 'mza', 'mzm', 'mzz', 'zaa', 'zam', 'zaz', 'zma', 'zmm', 'zmz', 'zza', 'zzm', 'zzz' ]
Code: 16:15:36 UTC,
js,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function dfs(have, now, state, mark, num, ans) {
if (num >= ans) {
return;
}
const mask = 1 << now;
if (mask > have) {
ans[0] = num;
return;
}
if ((mask & have) === 0) {
dfs(have, now + 1, state, mark, num, ans);
} else {
let temp = 0, d = 0;
for (let i = now + 1; i < 26; ++i) {
if (mark[i][now] && (have & (1 << i)) > 0) {
temp |= 1 << i;
++d;
}
}
dfs(have ^ temp, now + 1, state | temp, mark, num + d, ans);
dfs(have, now + 1, state | mask, mark, num + 1, ans);
}
}
function solution(P, Q) {
const mark = Array.from({ length: 26 }, () => Array(26).fill(false));
const n = P.length;
for (let i = 0; i < n; ++i) {
const p = P.charCodeAt(i) - 'a'.charCodeAt(0);
const q = Q.charCodeAt(i) - 'a'.charCodeAt(0);
mark[p][q] = mark[q][p] = true;
}
let temp = 0;
for (let i = 0; i < 26; ++i) {
if (mark[i][i]) {
++temp;
for (let j = 0; j < 26; ++j) {
mark[i][j] = mark[j][i] = false;
}
}
}
let have = 0;
for (let i = 0; i < 26; ++i) {
for (let j = 0; j < 26; ++j) {
if (mark[i][j]) {
have |= 1 << i;
break;
}
}
}
const ans = [P.length];
dfs(have, 0, 0, mark, temp, ans);
return ans[0];
}
Code: 16:15:37 UTC,
js,
verify,
result: Passed
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function dfs(have, now, state, mark, num, ans) {
if (num >= ans) {
return;
}
const mask = 1 << now;
if (mask > have) {
ans[0] = num;
return;
}
if ((mask & have) === 0) {
dfs(have, now + 1, state, mark, num, ans);
} else {
let temp = 0, d = 0;
for (let i = now + 1; i < 26; ++i) {
if (mark[i][now] && (have & (1 << i)) > 0) {
temp |= 1 << i;
++d;
}
}
dfs(have ^ temp, now + 1, state | temp, mark, num + d, ans);
dfs(have, now + 1, state | mask, mark, num + 1, ans);
}
}
function solution(P, Q) {
const mark = Array.from({ length: 26 }, () => Array(26).fill(false));
const n = P.length;
for (let i = 0; i < n; ++i) {
const p = P.charCodeAt(i) - 'a'.charCodeAt(0);
const q = Q.charCodeAt(i) - 'a'.charCodeAt(0);
mark[p][q] = mark[q][p] = true;
}
let temp = 0;
for (let i = 0; i < 26; ++i) {
if (mark[i][i]) {
++temp;
for (let j = 0; j < 26; ++j) {
mark[i][j] = mark[j][i] = false;
}
}
}
let have = 0;
for (let i = 0; i < 26; ++i) {
for (let j = 0; j < 26; ++j) {
if (mark[i][j]) {
have |= 1 << i;
break;
}
}
}
const ans = [P.length];
dfs(have, 0, 0, mark, temp, ans);
return ans[0];
}
Analysis
Code: 16:18:59 UTC,
js,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function dfs(have, now, state, mark, num, ans) {
if (num >= ans) {
return;
}
const mask = 1 << now;
if (mask > have) {
ans[0] = num;
return;
}
if ((mask & have) === 0) {
dfs(have, now + 1, state, mark, num, ans);
} else {
let temp = 0, d = 0;
for (let i = now + 1; i < 26; ++i) {
if (mark[i][now] && (have & (1 << i)) > 0) {
temp |= 1 << i;
++d;
}
}
dfs(have ^ temp, now + 1, state | temp, mark, num + d, ans);
dfs(have, now + 1, state | mask, mark, num + 1, ans);
}
}
function solution(P, Q) {
const mark = Array.from({ length: 26 }, () => Array(26).fill(false));
const n = P.length;
for (let i = 0; i < n; ++i) {
const p = P.charCodeAt(i) - 'a'.charCodeAt(0);
const q = Q.charCodeAt(i) - 'a'.charCodeAt(0);
mark[p][q] = mark[q][p] = true;
}
let temp = 0;
for (let i = 0; i < 26; ++i) {
if (mark[i][i]) {
++temp;
for (let j = 0; j < 26; ++j) {
mark[i][j] = mark[j][i] = false;
}
}
}
let have = 0;
for (let i = 0; i < 26; ++i) {
for (let j = 0; j < 26; ++j) {
if (mark[i][j]) {
have |= 1 << i;
break;
}
}
}
const ans = [P.length];
dfs(have, 0, 0, mark, temp, ans);
return ans[0];
}
Code: 16:19:13 UTC,
js,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
//In his code we are creating
function dfs(have, now, state, mark, num, ans) {
if (num >= ans) {
return;
}
const mask = 1 << now;
if (mask > have) {
ans[0] = num;
return;
}
if ((mask & have) === 0) {
dfs(have, now + 1, state, mark, num, ans);
} else {
let temp = 0, d = 0;
for (let i = now + 1; i < 26; ++i) {
if (mark[i][now] && (have & (1 << i)) > 0) {
temp |= 1 << i;
++d;
}
}
dfs(have ^ temp, now + 1, state | temp, mark, num + d, ans);
dfs(have, now + 1, state | mask, mark, num + 1, ans);
}
}
function solution(P, Q) {
const mark = Array.from({ length: 26 }, () => Array(26).fill(false));
const n = P.length;
for (let i = 0; i < n; ++i) {
const p = P.charCodeAt(i) - 'a'.charCodeAt(0);
const q = Q.charCodeAt(i) - 'a'.charCodeAt(0);
mark[p][q] = mark[q][p] = true;
}
let temp = 0;
for (let i = 0; i < 26; ++i) {
if (mark[i][i]) {
++temp;
for (let j = 0; j < 26; ++j) {
mark[i][j] = mark[j][i] = false;
}
}
}
let have = 0;
for (let i = 0; i < 26; ++i) {
for (let j = 0; j < 26; ++j) {
if (mark[i][j]) {
have |= 1 << i;
break;
}
}
}
const ans = [P.length];
dfs(have, 0, 0, mark, temp, ans);
return ans[0];
}
Code: 16:23:53 UTC,
js,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
//In his code we are creating
function firstSearch(have, now, state, mark, num, ans) {
if (num >= ans) {
return;
}
const mask = 1 << now;
if (mask > have) {
ans[0] = num;
return;
}
if ((mask & have) === 0) {
firstSearch(have, now + 1, state, mark, num, ans);
} else {
let temp = 0, d = 0;
for (let i = now + 1; i < 26; ++i) {
if (mark[i][now] && (have & (1 << i)) > 0) {
temp |= 1 << i;
++d;
}
}
firstSearch(have ^ temp, now + 1, state | temp, mark, num + d, ans);
firstSearch(have, now + 1, state | mask, mark, num + 1, ans);
}
}
function solution(P, Q) {
const mark = Array.from({ length: 26 }, () => Array(26).fill(false));
const n = P.length;
for (let i = 0; i < n; ++i) {
const p = P.charCodeAt(i) - 'a'.charCodeAt(0);
const q = Q.charCodeAt(i) - 'a'.charCodeAt(0);
mark[p][q] = mark[q][p] = true;
}
let temp = 0;
for (let i = 0; i < 26; ++i) {
if (mark[i][i]) {
++temp;
for (let j = 0; j < 26; ++j) {
mark[i][j] = mark[j][i] = false;
}
}
}
let have = 0;
for (let i = 0; i < 26; ++i) {
for (let j = 0; j < 26; ++j) {
if (mark[i][j]) {
have |= 1 << i;
break;
}
}
}
const ans = [P.length];
firstSearch(have, 0, 0, mark, temp, ans);
return ans[0];
}
Code: 16:24:22 UTC,
js,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
//In his code we are creating
function firstSearch(letters, now, state, mark, num, ans) {
if (num >= ans) {
return;
}
const mask = 1 << now;
if (mask > letters) {
ans[0] = num;
return;
}
if ((mask & letters) === 0) {
firstSearch(letters, now + 1, state, mark, num, ans);
} else {
let temp = 0, d = 0;
for (let i = now + 1; i < 26; ++i) {
if (mark[i][now] && (letters & (1 << i)) > 0) {
temp |= 1 << i;
++d;
}
}
firstSearch(letters ^ temp, now + 1, state | temp, mark, num + d, ans);
firstSearch(letters, now + 1, state | mask, mark, num + 1, ans);
}
}
function solution(P, Q) {
const mark = Array.from({ length: 26 }, () => Array(26).fill(false));
const n = P.length;
for (let i = 0; i < n; ++i) {
const p = P.charCodeAt(i) - 'a'.charCodeAt(0);
const q = Q.charCodeAt(i) - 'a'.charCodeAt(0);
mark[p][q] = mark[q][p] = true;
}
let temp = 0;
for (let i = 0; i < 26; ++i) {
if (mark[i][i]) {
++temp;
for (let j = 0; j < 26; ++j) {
mark[i][j] = mark[j][i] = false;
}
}
}
let have = 0;
for (let i = 0; i < 26; ++i) {
for (let j = 0; j < 26; ++j) {
if (mark[i][j]) {
have |= 1 << i;
break;
}
}
}
const ans = [P.length];
firstSearch(have, 0, 0, mark, temp, ans);
return ans[0];
}
Code: 16:24:37 UTC,
js,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
//In his code we are creating
function firstSearch(letters, current, state, mark, num, ans) {
if (num >= ans) {
return;
}
const mask = 1 << current;
if (mask > letters) {
ans[0] = num;
return;
}
if ((mask & letters) === 0) {
firstSearch(letters, current + 1, state, mark, num, ans);
} else {
let temp = 0, d = 0;
for (let i = current + 1; i < 26; ++i) {
if (mark[i][current] && (letters & (1 << i)) > 0) {
temp |= 1 << i;
++d;
}
}
firstSearch(letters ^ temp, current + 1, state | temp, mark, num + d, ans);
firstSearch(letters, current + 1, state | mask, mark, num + 1, ans);
}
}
function solution(P, Q) {
const mark = Array.from({ length: 26 }, () => Array(26).fill(false));
const n = P.length;
for (let i = 0; i < n; ++i) {
const p = P.charCodeAt(i) - 'a'.charCodeAt(0);
const q = Q.charCodeAt(i) - 'a'.charCodeAt(0);
mark[p][q] = mark[q][p] = true;
}
let temp = 0;
for (let i = 0; i < 26; ++i) {
if (mark[i][i]) {
++temp;
for (let j = 0; j < 26; ++j) {
mark[i][j] = mark[j][i] = false;
}
}
}
let have = 0;
for (let i = 0; i < 26; ++i) {
for (let j = 0; j < 26; ++j) {
if (mark[i][j]) {
have |= 1 << i;
break;
}
}
}
const ans = [P.length];
firstSearch(have, 0, 0, mark, temp, ans);
return ans[0];
}
Code: 16:25:33 UTC,
js,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
//In his code we are creating
function firstSearch(letters, current, selectedLetter, mark, num, ans) {
if (num >= ans) {
return;
}
const mask = 1 << current;
if (mask > letters) {
ans[0] = num;
return;
}
if ((mask & letters) === 0) {
firstSearch(letters, current + 1, selectedLetter, mark, num, ans);
} else {
let temp = 0, d = 0;
for (let i = current + 1; i < 26; ++i) {
if (mark[i][current] && (letters & (1 << i)) > 0) {
temp |= 1 << i;
++d;
}
}
firstSearch(letters ^ temp, current + 1, selectedLetter | temp, mark, num + d, ans);
firstSearch(letters, current + 1, selectedLetter | mask, mark, num + 1, ans);
}
}
function solution(P, Q) {
const mark = Array.from({ length: 26 }, () => Array(26).fill(false));
const n = P.length;
for (let i = 0; i < n; ++i) {
const p = P.charCodeAt(i) - 'a'.charCodeAt(0);
const q = Q.charCodeAt(i) - 'a'.charCodeAt(0);
mark[p][q] = mark[q][p] = true;
}
let temp = 0;
for (let i = 0; i < 26; ++i) {
if (mark[i][i]) {
++temp;
for (let j = 0; j < 26; ++j) {
mark[i][j] = mark[j][i] = false;
}
}
}
let have = 0;
for (let i = 0; i < 26; ++i) {
for (let j = 0; j < 26; ++j) {
if (mark[i][j]) {
have |= 1 << i;
break;
}
}
}
const ans = [P.length];
firstSearch(have, 0, 0, mark, temp, ans);
return ans[0];
}
Code: 16:26:16 UTC,
js,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
//In his code we are creating
function firstSearch(letters, current, selectedLetter, flag, num, ans) {
if (num >= ans) {
return;
}
const mask = 1 << current;
if (mask > letters) {
ans[0] = num;
return;
}
if ((mask & letters) === 0) {
firstSearch(letters, current + 1, selectedLetter, flag, num, ans);
} else {
let temp = 0, d = 0;
for (let i = current + 1; i < 26; ++i) {
if (flag[i][current] && (letters & (1 << i)) > 0) {
temp |= 1 << i;
++d;
}
}
firstSearch(letters ^ temp, current + 1, selectedLetter | temp, flag, num + d, ans);
firstSearch(letters, current + 1, selectedLetter | mask, flag, num + 1, ans);
}
}
function solution(P, Q) {
const mark = Array.from({ length: 26 }, () => Array(26).fill(false));
const n = P.length;
for (let i = 0; i < n; ++i) {
const p = P.charCodeAt(i) - 'a'.charCodeAt(0);
const q = Q.charCodeAt(i) - 'a'.charCodeAt(0);
mark[p][q] = mark[q][p] = true;
}
let temp = 0;
for (let i = 0; i < 26; ++i) {
if (mark[i][i]) {
++temp;
for (let j = 0; j < 26; ++j) {
mark[i][j] = mark[j][i] = false;
}
}
}
let have = 0;
for (let i = 0; i < 26; ++i) {
for (let j = 0; j < 26; ++j) {
if (mark[i][j]) {
have |= 1 << i;
break;
}
}
}
const ans = [P.length];
firstSearch(have, 0, 0, mark, temp, ans);
return ans[0];
}
Code: 16:26:43 UTC,
js,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
//In his code we are creating
function firstSearch(letters, current, selectedLetter, flag, currentLettersSize, ans) {
if (currentLettersSize >= ans) {
return;
}
const mask = 1 << current;
if (mask > letters) {
ans[0] = currentLettersSize;
return;
}
if ((mask & letters) === 0) {
firstSearch(letters, current + 1, selectedLetter, flag, currentLettersSize, ans);
} else {
let temp = 0, d = 0;
for (let i = current + 1; i < 26; ++i) {
if (flag[i][current] && (letters & (1 << i)) > 0) {
temp |= 1 << i;
++d;
}
}
firstSearch(letters ^ temp, current + 1, selectedLetter | temp, flag, currentLettersSize + d, ans);
firstSearch(letters, current + 1, selectedLetter | mask, flag, currentLettersSize + 1, ans);
}
}
function solution(P, Q) {
const mark = Array.from({ length: 26 }, () => Array(26).fill(false));
const n = P.length;
for (let i = 0; i < n; ++i) {
const p = P.charCodeAt(i) - 'a'.charCodeAt(0);
const q = Q.charCodeAt(i) - 'a'.charCodeAt(0);
mark[p][q] = mark[q][p] = true;
}
let temp = 0;
for (let i = 0; i < 26; ++i) {
if (mark[i][i]) {
++temp;
for (let j = 0; j < 26; ++j) {
mark[i][j] = mark[j][i] = false;
}
}
}
let have = 0;
for (let i = 0; i < 26; ++i) {
for (let j = 0; j < 26; ++j) {
if (mark[i][j]) {
have |= 1 << i;
break;
}
}
}
const ans = [P.length];
firstSearch(have, 0, 0, mark, temp, ans);
return ans[0];
}
Code: 16:27:02 UTC,
js,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
//In his code we are creating
function firstSearch(letters, current, selectedLetter, flag, currentLettersSize, minOperationsNeeded) {
if (currentLettersSize >= minOperationsNeeded) {
return;
}
const mask = 1 << current;
if (mask > letters) {
minOperationsNeeded[0] = currentLettersSize;
return;
}
if ((mask & letters) === 0) {
firstSearch(letters, current + 1, selectedLetter, flag, currentLettersSize, minOperationsNeeded);
} else {
let temp = 0, d = 0;
for (let i = current + 1; i < 26; ++i) {
if (flag[i][current] && (letters & (1 << i)) > 0) {
temp |= 1 << i;
++d;
}
}
firstSearch(letters ^ temp, current + 1, selectedLetter | temp, flag, currentLettersSize + d, minOperationsNeeded);
firstSearch(letters, current + 1, selectedLetter | mask, flag, currentLettersSize + 1, minOperationsNeeded);
}
}
function solution(P, Q) {
const mark = Array.from({ length: 26 }, () => Array(26).fill(false));
const n = P.length;
for (let i = 0; i < n; ++i) {
const p = P.charCodeAt(i) - 'a'.charCodeAt(0);
const q = Q.charCodeAt(i) - 'a'.charCodeAt(0);
mark[p][q] = mark[q][p] = true;
}
let temp = 0;
for (let i = 0; i < 26; ++i) {
if (mark[i][i]) {
++temp;
for (let j = 0; j < 26; ++j) {
mark[i][j] = mark[j][i] = false;
}
}
}
let have = 0;
for (let i = 0; i < 26; ++i) {
for (let j = 0; j < 26; ++j) {
if (mark[i][j]) {
have |= 1 << i;
break;
}
}
}
const ans = [P.length];
firstSearch(have, 0, 0, mark, temp, ans);
return ans[0];
}
Code: 16:30:45 UTC,
js,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
//In his code we are creating
function firstSearch(letters, current, selectedLetter, flag, currentLettersSize, minOperationsNeeded) {
if (currentLettersSize >= minOperationsNeeded) {
return;
}
const lettersSize = 1 << current;
if (lettersSize > letters) {
minOperationsNeeded[0] = currentLettersSize;
return;
}
if ((lettersSize & letters) === 0) {
firstSearch(letters, current + 1, selectedLetter, flag, currentLettersSize, minOperationsNeeded);
} else {
let temp = 0, d = 0;
for (let i = current + 1; i < 26; ++i) {
if (flag[i][current] && (letters & (1 << i)) > 0) {
temp |= 1 << i;
++d;
}
}
firstSearch(letters ^ temp, current + 1, selectedLetter | temp, flag, currentLettersSize + d, minOperationsNeeded);
firstSearch(letters, current + 1, selectedLetter | lettersSize, flag, currentLettersSize + 1, minOperationsNeeded);
}
}
function solution(P, Q) {
const mark = Array.from({ length: 26 }, () => Array(26).fill(false));
const n = P.length;
for (let i = 0; i < n; ++i) {
const p = P.charCodeAt(i) - 'a'.charCodeAt(0);
const q = Q.charCodeAt(i) - 'a'.charCodeAt(0);
mark[p][q] = mark[q][p] = true;
}
let temp = 0;
for (let i = 0; i < 26; ++i) {
if (mark[i][i]) {
++temp;
for (let j = 0; j < 26; ++j) {
mark[i][j] = mark[j][i] = false;
}
}
}
let have = 0;
for (let i = 0; i < 26; ++i) {
for (let j = 0; j < 26; ++j) {
if (mark[i][j]) {
have |= 1 << i;
break;
}
}
}
const ans = [P.length];
firstSearch(have, 0, 0, mark, temp, ans);
return ans[0];
}
Code: 16:30:51 UTC,
js,
verify,
result: Passed
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
//In his code we are creating
function firstSearch(letters, current, selectedLetter, flag, currentLettersSize, minOperationsNeeded) {
if (currentLettersSize >= minOperationsNeeded) {
return;
}
const lettersSize = 1 << current;
if (lettersSize > letters) {
minOperationsNeeded[0] = currentLettersSize;
return;
}
if ((lettersSize & letters) === 0) {
firstSearch(letters, current + 1, selectedLetter, flag, currentLettersSize, minOperationsNeeded);
} else {
let temp = 0, d = 0;
for (let i = current + 1; i < 26; ++i) {
if (flag[i][current] && (letters & (1 << i)) > 0) {
temp |= 1 << i;
++d;
}
}
firstSearch(letters ^ temp, current + 1, selectedLetter | temp, flag, currentLettersSize + d, minOperationsNeeded);
firstSearch(letters, current + 1, selectedLetter | lettersSize, flag, currentLettersSize + 1, minOperationsNeeded);
}
}
function solution(P, Q) {
const mark = Array.from({ length: 26 }, () => Array(26).fill(false));
const n = P.length;
for (let i = 0; i < n; ++i) {
const p = P.charCodeAt(i) - 'a'.charCodeAt(0);
const q = Q.charCodeAt(i) - 'a'.charCodeAt(0);
mark[p][q] = mark[q][p] = true;
}
let temp = 0;
for (let i = 0; i < 26; ++i) {
if (mark[i][i]) {
++temp;
for (let j = 0; j < 26; ++j) {
mark[i][j] = mark[j][i] = false;
}
}
}
let have = 0;
for (let i = 0; i < 26; ++i) {
for (let j = 0; j < 26; ++j) {
if (mark[i][j]) {
have |= 1 << i;
break;
}
}
}
const ans = [P.length];
firstSearch(have, 0, 0, mark, temp, ans);
return ans[0];
}
Analysis
Code: 16:35:56 UTC,
js,
verify,
result: Passed
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
//In his code we are creating
function firstSearch(letters, current, selectedLetter, flag, currentLettersSize, minOperationsNeeded) {
if (currentLettersSize >= minOperationsNeeded) {
return;
}
const lettersSize = 1 << current;
if (lettersSize > letters) {
minOperationsNeeded[0] = currentLettersSize;
return;
}
if ((lettersSize & letters) === 0) {
firstSearch(letters, current + 1, selectedLetter, flag, currentLettersSize, minOperationsNeeded);
} else {
let temp = 0, d = 0;
for (let i = current + 1; i < 26; ++i) {
if (flag[i][current] && (letters & (1 << i)) > 0) {
temp |= 1 << i;
++d;
}
}
firstSearch(letters ^ temp, current + 1, selectedLetter | temp, flag, currentLettersSize + d, minOperationsNeeded);
firstSearch(letters, current + 1, selectedLetter | lettersSize, flag, currentLettersSize + 1, minOperationsNeeded);
}
}
function solution(P, Q) {
const mark = Array.from({ length: 26 }, () => Array(26).fill(false));
const n = P.length;
for (let i = 0; i < n; ++i) {
const p = P.charCodeAt(i) - 'a'.charCodeAt(0);
const q = Q.charCodeAt(i) - 'a'.charCodeAt(0);
mark[p][q] = mark[q][p] = true;
}
let temp = 0;
for (let i = 0; i < 26; ++i) {
if (mark[i][i]) {
++temp;
for (let j = 0; j < 26; ++j) {
mark[i][j] = mark[j][i] = false;
}
}
}
let have = 0;
for (let i = 0; i < 26; ++i) {
for (let j = 0; j < 26; ++j) {
if (mark[i][j]) {
have |= 1 << i;
break;
}
}
}
const ans = [P.length];
firstSearch(have, 0, 0, mark, temp, ans);
return ans[0];
}
Analysis
Code: 16:36:00 UTC,
js,
final,
score:
100
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
//In his code we are creating
function firstSearch(letters, current, selectedLetter, flag, currentLettersSize, minOperationsNeeded) {
if (currentLettersSize >= minOperationsNeeded) {
return;
}
const lettersSize = 1 << current;
if (lettersSize > letters) {
minOperationsNeeded[0] = currentLettersSize;
return;
}
if ((lettersSize & letters) === 0) {
firstSearch(letters, current + 1, selectedLetter, flag, currentLettersSize, minOperationsNeeded);
} else {
let temp = 0, d = 0;
for (let i = current + 1; i < 26; ++i) {
if (flag[i][current] && (letters & (1 << i)) > 0) {
temp |= 1 << i;
++d;
}
}
firstSearch(letters ^ temp, current + 1, selectedLetter | temp, flag, currentLettersSize + d, minOperationsNeeded);
firstSearch(letters, current + 1, selectedLetter | lettersSize, flag, currentLettersSize + 1, minOperationsNeeded);
}
}
function solution(P, Q) {
const mark = Array.from({ length: 26 }, () => Array(26).fill(false));
const n = P.length;
for (let i = 0; i < n; ++i) {
const p = P.charCodeAt(i) - 'a'.charCodeAt(0);
const q = Q.charCodeAt(i) - 'a'.charCodeAt(0);
mark[p][q] = mark[q][p] = true;
}
let temp = 0;
for (let i = 0; i < 26; ++i) {
if (mark[i][i]) {
++temp;
for (let j = 0; j < 26; ++j) {
mark[i][j] = mark[j][i] = false;
}
}
}
let have = 0;
for (let i = 0; i < 26; ++i) {
for (let j = 0; j < 26; ++j) {
if (mark[i][j]) {
have |= 1 << i;
break;
}
}
}
const ans = [P.length];
firstSearch(have, 0, 0, mark, temp, ans);
return ans[0];
}
Analysis summary
The solution obtained perfect score.
Analysis
Detected time complexity:
O(2**A * A**2 + N) or O(2**A * A**2 + N * A**2)
Time complexity parameters:
A - size of the alphabet
A - size of the alphabet
expand all
Correctness tests
1.
0.056 s
OK
2.
0.056 s
OK
3.
0.056 s
OK
4.
0.056 s
OK
5.
0.056 s
OK
6.
0.056 s
OK
7.
0.056 s
OK
1.
0.056 s
OK
2.
0.056 s
OK
3.
0.060 s
OK
4.
0.056 s
OK
5.
0.056 s
OK
6.
0.056 s
OK
7.
0.056 s
OK
8.
0.056 s
OK
9.
0.056 s
OK
10.
0.056 s
OK
1.
0.056 s
OK
2.
0.056 s
OK
3.
0.056 s
OK
4.
0.056 s
OK
5.
0.056 s
OK
6.
0.056 s
OK
7.
0.056 s
OK
small_freq
Small tests where some letters have big but similar frequencies, N <= 17, A <= 12.
Small tests where some letters have big but similar frequencies, N <= 17, A <= 12.
✔
OK
1.
0.056 s
OK
2.
0.056 s
OK
3.
0.056 s
OK
4.
0.056 s
OK
5.
0.056 s
OK
6.
0.056 s
OK
7.
0.060 s
OK
8.
0.056 s
OK
expand all
Correctness/performance tests
1.
0.056 s
OK
2.
0.056 s
OK
3.
0.056 s
OK
1.
0.056 s
OK
2.
0.056 s
OK
3.
0.056 s
OK
4.
0.056 s
OK
5.
0.056 s
OK
6.
0.056 s
OK
1.
0.056 s
OK
2.
0.056 s
OK
3.
0.056 s
OK
4.
0.056 s
OK
5.
0.060 s
OK
expand all
Performance tests
1.
0.056 s
OK
2.
0.056 s
OK
3.
0.060 s
OK
1.
0.064 s
OK
2.
0.064 s
OK
3.
0.064 s
OK
1.
0.064 s
OK
2.
0.068 s
OK
3.
0.056 s
OK
4.
0.064 s
OK