Tasks Details
The submission is being evaluated.
The submission is being evaluated.
The submission is being evaluated.
The submission is being evaluated.
The submission is being evaluated.
The submission is being evaluated.
The submission is being evaluated.
The submission is being evaluated.
The submission is being evaluated.
easy
1.
Brackets
Determine whether a given string of parentheses (multiple types) is properly nested.
Task Score
100%
Correctness
100%
Performance
100%
A string S consisting of N characters is considered to be properly nested if any of the following conditions is true:
- S is empty;
- S has the form "(U)" or "[U]" or "{U}" where U is a properly nested string;
- S has the form "VW" where V and W are properly nested strings.
For example, the string "{[()()]}" is properly nested but "([)()]" is not.
Write a function:
function solution(S);
that, given a string S consisting of N characters, returns 1 if S is properly nested and 0 otherwise.
For example, given S = "{[()()]}", the function should return 1 and given S = "([)()]", the function should return 0, as explained above.
Write an efficient algorithm for the following assumptions:
- N is an integer within the range [0..200,000];
- string S is made only of the following characters: '(', '{', '[', ']', '}' and/or ')'.
Copyright 2009–2025 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.
Solution
Programming language used JavaScript
Time spent on task 9 minutes
Notes
not defined yet
Code: 06:21:20 UTC,
java,
autosave
Code: 06:21:20 UTC,
java,
autosave
Code: 06:21:27 UTC,
js,
verify,
result: Failed
// 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 N = S.length;
let stack = [];
for(let i=0; i<N; i++){
switch(S.chatAt(i)){
case '(':
case '{':
case '[':
stack.push(S.chatAt(i));
break;
case ')':
if(stack.top() == '('){
stack.pop();
}
else{
return 0;
}
break;
case '}':
if(stack.top() == '{'){
stack.pop();
}
else{
return 0;
}
break;
case ']':
if(stack.top() == '['){
stack.pop();
}
else{
return 0;
}
break;
}
}
return stack.empty();
}
The submission is being evaluated.
Code: 06:21: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 N = S.length;
let stack = [];
for(let i=0; i<N; i++){
switch(S.charAt(i)){
case '(':
case '{':
case '[':
stack.push(S.chatAt(i));
break;
case ')':
if(stack.top() == '('){
stack.pop();
}
else{
return 0;
}
break;
case '}':
if(stack.top() == '{'){
stack.pop();
}
else{
return 0;
}
break;
case ']':
if(stack.top() == '['){
stack.pop();
}
else{
return 0;
}
break;
}
}
return stack.empty();
}
Code: 06:21:58 UTC,
js,
verify,
result: Failed
// 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 N = S.length;
let stack = [];
for(let i=0; i<N; i++){
switch(S.charAt(i)){
case '(':
case '{':
case '[':
stack.push(S.charAt(i));
break;
case ')':
if(stack.top() == '('){
stack.pop();
}
else{
return 0;
}
break;
case '}':
if(stack.top() == '{'){
stack.pop();
}
else{
return 0;
}
break;
case ']':
if(stack.top() == '['){
stack.pop();
}
else{
return 0;
}
break;
}
}
return stack.empty();
}
The submission is being evaluated.
Code: 06:24:43 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 N = S.length;
let stack = [];
for(let i=0; i<N; i++){
switch(S.charAt(i)){
case '(':
case '{':
case '[':
stack.push(S.charAt(i));
break;
case ')':
if(stack. == '('){
stack.pop();
}
else{
return 0;
}
break;
case '}':
if(stack.top() == '{'){
stack.pop();
}
else{
return 0;
}
break;
case ']':
if(stack.top() == '['){
stack.pop();
}
else{
return 0;
}
break;
}
}
return stack.empty();
}
Code: 06:24:53 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 N = S.length;
let stack = [];
for(let i=0; i<N; i++){
switch(S.charAt(i)){
case '(':
case '{':
case '[':
stack.push(S.charAt(i));
break;
case ')':
if(stack[stack.length-1] == '('){
stack.pop();
}
else{
return 0;
}
break;
case '}':
if(stack.top() == '{'){
stack.pop();
}
else{
return 0;
}
break;
case ']':
if(stack.top() == '['){
stack.pop();
}
else{
return 0;
}
break;
}
}
return stack.empty();
}
Code: 06:25:02 UTC,
js,
verify,
result: Failed
// 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 N = S.length;
let stack = [];
for(let i=0; i<N; i++){
switch(S.charAt(i)){
case '(':
case '{':
case '[':
stack.push(S.charAt(i));
break;
case ')':
if(stack[stack.length-1] == '('){
stack.pop();
}
else{
return 0;
}
break;
case '}':
if(stack[stack.length-1] == '{'){
stack.pop();
}
else{
return 0;
}
break;
case ']':
if(stack[stack.length-1] == '['){
stack.pop();
}
else{
return 0;
}
break;
}
}
return stack.empty();
}
The submission is being evaluated.
Code: 06:25:31 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 N = S.length;
let stack = [];
for(let i=0; i<N; i++){
switch(S.charAt(i)){
case '(':
case '{':
case '[':
stack.push(S.charAt(i));
break;
case ')':
if(stack[stack.length-1] == '('){
stack.pop();
}
else{
return 0;
}
break;
case '}':
if(stack[stack.length-1] == '{'){
stack.pop();
}
else{
return 0;
}
break;
case ']':
if(stack[stack.length-1] == '['){
stack.pop();
}
else{
return 0;
}
break;
}
}
if
return stack.empty();
}
Code: 06:25:57 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 N = S.length;
let stack = [];
for(let i=0; i<N; i++){
switch(S.charAt(i)){
case '(':
case '{':
case '[':
stack.push(S.charAt(i));
break;
case ')':
if(stack[stack.length-1] == '('){
stack.pop();
}
else{
return 0;
}
break;
case '}':
if(stack[stack.length-1] == '{'){
stack.pop();
}
else{
return 0;
}
break;
case ']':
if(stack[stack.length-1] == '['){
stack.pop();
}
else{
return 0;
}
break;
}
}
if(!stack){
return 1;
}
else{
return 0;
}
}
Code: 06:25:58 UTC,
js,
verify,
result: Failed
// 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 N = S.length;
let stack = [];
for(let i=0; i<N; i++){
switch(S.charAt(i)){
case '(':
case '{':
case '[':
stack.push(S.charAt(i));
break;
case ')':
if(stack[stack.length-1] == '('){
stack.pop();
}
else{
return 0;
}
break;
case '}':
if(stack[stack.length-1] == '{'){
stack.pop();
}
else{
return 0;
}
break;
case ']':
if(stack[stack.length-1] == '['){
stack.pop();
}
else{
return 0;
}
break;
}
}
if(!stack){
return 1;
}
else{
return 0;
}
}
The submission is being evaluated.
Code: 06:26:23 UTC,
js,
verify,
result: Failed
// 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 N = S.length;
let stack = [];
for(let i=0; i<N; i++){
switch(S.charAt(i)){
case '(':
case '{':
case '[':
stack.push(S.charAt(i));
break;
case ')':
if(stack[stack.length-1] == '('){
stack.pop();
}
else{
return 0;
}
break;
case '}':
if(stack[stack.length-1] == '{'){
stack.pop();
}
else{
return 0;
}
break;
case ']':
if(stack[stack.length-1] == '['){
stack.pop();
}
else{
return 0;
}
break;
}
}
console.log(stack);
if(!stack){
return 1;
}
else{
return 0;
}
}
The submission is being evaluated.
Code: 06:28:45 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 N = S.length;
let stack = [];
for(let i=0; i<N; i++){
switch(S.charAt(i)){
case '(':
case '{':
case '[':
stack.push(S.charAt(i));
break;
case ')':
if(stack[stack.length-1] == '('){
stack.pop();
}
else{
return 0;
}
break;
case '}':
if(stack[stack.length-1] == '{'){
stack.pop();
}
else{
return 0;
}
break;
case ']':
if(stack[stack.length-1] == '['){
stack.pop();
}
else{
return 0;
}
break;
}
}
console.log(stack);
if(stack){
return 1;
}
else{
return 0;
}
}
Code: 06:29:02 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 N = S.length;
let stack = [];
for(let i=0; i<N; i++){
switch(S.charAt(i)){
case '(':
case '{':
case '[':
stack.push(S.charAt(i));
break;
case ')':
if(stack[stack.length-1] == '('){
stack.pop();
}
else{
return 0;
}
break;
case '}':
if(stack[stack.length-1] == '{'){
stack.pop();
}
else{
return 0;
}
break;
case ']':
if(stack[stack.length-1] == '['){
stack.pop();
}
else{
return 0;
}
break;
}
}
console.log(stack);
if(stack.length > 0){
return 0;
}
else{
return 1;
}
}
The submission is being evaluated.
Code: 06:29:14 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 N = S.length;
let stack = [];
for(let i=0; i<N; i++){
switch(S.charAt(i)){
case '(':
case '{':
case '[':
stack.push(S.charAt(i));
break;
case ')':
if(stack[stack.length-1] == '('){
stack.pop();
}
else{
return 0;
}
break;
case '}':
if(stack[stack.length-1] == '{'){
stack.pop();
}
else{
return 0;
}
break;
case ']':
if(stack[stack.length-1] == '['){
stack.pop();
}
else{
return 0;
}
break;
}
}
if(stack.length > 0){
return 0;
}
else{
return 1;
}
}
Code: 06:29:52 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 N = S.length;
let stack = [];
for(let i=0; i<N; i++){
switch(S.charAt(i)){
case '(':
case '{':
case '[':
stack.push(S.charAt(i));
break;
case ')':
if(stack[stack.length-1] == '('){
stack.pop();
}
else{
return 0;
}
break;
case '}':
if(stack[stack.length-1] == '{'){
stack.pop();
}
else{
return 0;
}
break;
case ']':
if(stack[stack.length-1] == '['){
stack.pop();
}
else{
return 0;
}
break;
}
}
if(stack.length > 0){
return 0;
}
else{
return 1;
}
}
The submission is being evaluated.
Code: 06:29:57 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 N = S.length;
let stack = [];
for(let i=0; i<N; i++){
switch(S.charAt(i)){
case '(':
case '{':
case '[':
stack.push(S.charAt(i));
break;
case ')':
if(stack[stack.length-1] == '('){
stack.pop();
}
else{
return 0;
}
break;
case '}':
if(stack[stack.length-1] == '{'){
stack.pop();
}
else{
return 0;
}
break;
case ']':
if(stack[stack.length-1] == '['){
stack.pop();
}
else{
return 0;
}
break;
}
}
if(stack.length > 0){
return 0;
}
else{
return 1;
}
}
The submission is being evaluated.
Code: 06:29:59 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 N = S.length;
let stack = [];
for(let i=0; i<N; i++){
switch(S.charAt(i)){
case '(':
case '{':
case '[':
stack.push(S.charAt(i));
break;
case ')':
if(stack[stack.length-1] == '('){
stack.pop();
}
else{
return 0;
}
break;
case '}':
if(stack[stack.length-1] == '{'){
stack.pop();
}
else{
return 0;
}
break;
case ']':
if(stack[stack.length-1] == '['){
stack.pop();
}
else{
return 0;
}
break;
}
}
if(stack.length > 0){
return 0;
}
else{
return 1;
}
}
The submission is being evaluated.