Tasks Details
easy
Given a string containing words, find the longest word that satisfies specific conditions.
Task Score
100%
Correctness
100%
Performance
Not assessed
You would like to set a password for a bank account. However, there are three restrictions on the format of the password:
- it has to contain only alphanumerical characters (a−z, A−Z, 0−9);
- there should be an even number of letters;
- there should be an odd number of digits.
You are given a string S consisting of N characters. String S can be divided into words by splitting it at, and removing, the spaces. The goal is to choose the longest word that is a valid password. You can assume that if there are K spaces in string S then there are exactly K + 1 words.
For example, given "test 5 a0A pass007 ?xy1", there are five words and three of them are valid passwords: "5", "a0A" and "pass007". Thus the longest password is "pass007" and its length is 7. Note that neither "test" nor "?xy1" is a valid password, because "?" is not an alphanumerical character and "test" contains an even number of digits (zero).
Write a function:
function solution(S);
that, given a non-empty string S consisting of N characters, returns the length of the longest word from the string that is a valid password. If there is no such word, your function should return −1.
For example, given S = "test 5 a0A pass007 ?xy1", your function should return 7, as explained above.
Assume that:
- N is an integer within the range [1..200];
- string S consists only of printable ASCII characters and spaces.
In your solution, focus on correctness. The performance of your solution will not be the focus of the assessment.
Copyright 2009–2025 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.
Solution
Programming language used JavaScript
Time spent on task 2 minutes
Notes
not defined yet
Code: 09:26:31 UTC,
java,
autosave
Code: 09:26:43 UTC,
js,
verify,
result: Passed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(S) {
// write your code in JavaScript (Node.js 8.9.4)
const words = S.split(' ');
let longest = -1;
for (let word of words) {
const stripped = word.replace(/[^0-9a-z]/gi, '');
if (word.length === stripped.length) {
const letters = stripped.replace(/[^a-z]/gi, '');
const numbers = stripped.replace(/[^0-9]/g, '');
if (letters.length % 2 === 0 && numbers.length % 2 === 1) {
longest = Math.max(longest, letters.length + numbers.length)
}
}
}
return longest;
}
Analysis
Code: 09:27:27 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(S) {
// write your code in JavaScript (Node.js 8.9.4)
const words = S.split(' ');
let longest = -1;
for (let word of words) {
const stripped = word.replace(/[^0-9a-z]/gi, '');
if (word.length === stripped.length) {
const letters = stripped.replace(/[^a-z]/gi, '');
const numbers = stripped.replace(/[^0-9]/g, '');
if (letters.length % 2 === 0 && numbers.length % 2 === 1) {
longest = Math.max(longest, letters.length + numbers.length)
}
}
}
return longest;
}
Code: 09:27:51 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(S) {
// write your code in JavaScript (Node.js 8.9.4)
const words = S.split(' ');
let longest = -1;
for (let word of words) {
const stripped = word.replace(/[^0-9a-z]/gi, '');
if (word.length === stripped.length) {
const letters = stripped.replace(/[^a-z]/gi, '');
const numbers = stripped.replace(/[^0-9]/g, '');
if (letters.length % 2 === 0 && numbers.length % 2 === 1) {
longest = Math.max(longest, letters.length + numbers.length)
}
}
}
return longest;
}
Code: 09:27:55 UTC,
js,
verify,
result: Passed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(S) {
// write your code in JavaScript (Node.js 8.9.4)
const words = S.split(' ');
let longest = -1;
for (let word of words) {
const stripped = word.replace(/[^0-9a-z]/gi, '');
if (word.length === stripped.length) {
const letters = stripped.replace(/[^a-z]/gi, '');
const numbers = stripped.replace(/[^0-9]/g, '');
if (letters.length % 2 === 0 && numbers.length % 2 === 1) {
longest = Math.max(longest, letters.length + numbers.length)
}
}
}
return longest;
}
User test case 1:
['a']
User test case 2:
['? ? ? ? ?']
User test case 3:
['as1 word22']
User test case 4:
['thisisaReallyLongWordyes123']
Analysis
expand all
User tests
1.
0.072 s
OK
function result: -1
function result: -1
1.
0.072 s
OK
function result: -1
function result: -1
1.
0.068 s
OK
function result: 3
function result: 3
1.
0.068 s
OK
function result: 27
function result: 27
Code: 09:28:08 UTC,
js,
verify,
result: Passed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(S) {
// write your code in JavaScript (Node.js 8.9.4)
const words = S.split(' ');
let longest = -1;
for (let word of words) {
const stripped = word.replace(/[^0-9a-z]/gi, '');
if (word.length === stripped.length) {
const letters = stripped.replace(/[^a-z]/gi, '');
const numbers = stripped.replace(/[^0-9]/g, '');
if (letters.length % 2 === 0 && numbers.length % 2 === 1) {
longest = Math.max(longest, letters.length + numbers.length)
}
}
}
return longest;
}
User test case 1:
['a']
User test case 2:
['? ? ? ? ?']
User test case 3:
['as1 word22']
User test case 4:
['thisisaReallyLongWordyes123']
Analysis
expand all
User tests
1.
0.068 s
OK
function result: -1
function result: -1
1.
0.068 s
OK
function result: -1
function result: -1
1.
0.068 s
OK
function result: 3
function result: 3
1.
0.068 s
OK
function result: 27
function result: 27
Code: 09:28:10 UTC,
js,
final,
score:
100
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(S) {
// write your code in JavaScript (Node.js 8.9.4)
const words = S.split(' ');
let longest = -1;
for (let word of words) {
const stripped = word.replace(/[^0-9a-z]/gi, '');
if (word.length === stripped.length) {
const letters = stripped.replace(/[^a-z]/gi, '');
const numbers = stripped.replace(/[^0-9]/g, '');
if (letters.length % 2 === 0 && numbers.length % 2 === 1) {
longest = Math.max(longest, letters.length + numbers.length)
}
}
}
return longest;
}Analysis summary
The solution obtained perfect score.
Analysis
expand all
Correctness tests
1.
0.068 s
OK
2.
0.068 s
OK
3.
0.068 s
OK
4.
0.068 s
OK
1.
0.068 s
OK
2.
0.068 s
OK
3.
0.068 s
OK
4.
0.068 s
OK
5.
0.068 s
OK
1.
0.068 s
OK
2.
0.068 s
OK
3.
0.068 s
OK
4.
0.068 s
OK
5.
0.068 s
OK
6.
0.068 s
OK
7.
0.068 s
OK
1.
0.068 s
OK
2.
0.068 s
OK
3.
0.068 s
OK
1.
0.068 s
OK
2.
0.068 s
OK
3.
0.068 s
OK
1.
0.068 s
OK
2.
0.068 s
OK
1.
0.068 s
OK
2.
0.068 s
OK
3.
0.068 s
OK
1.
0.068 s
OK
2.
0.068 s
OK
3.
0.068 s
OK
4.
0.068 s
OK
1.
0.068 s
OK
2.
0.068 s
OK
3.
0.068 s
OK
1.
0.068 s
OK
2.
0.068 s
OK
3.
0.068 s
OK
4.
0.068 s
OK
5.
0.068 s
OK