Stacks in JavaScript

Introduction

Greetings! Today, we're drawing back the curtains on Stacks in JavaScript, a crucial data structure. A stack is like a pile of dishes: you add a dish to the top (Last In) and take it from the top (First Out). This Last-In, First-Out (LIFO) principle exemplifies the stack. JavaScript executes stacks effortlessly using Arrays . This lesson will illuminate the stack data structure, operations, and their JavaScript applications. Are you ready to start?

Understanding Stack: A Data Structure on the Rise

A stack is an elongated storehouse permitting Push (addition) and Pop (removal) operations. It's akin to a stack of plates in a cafeteria where plates are added (pushed) and removed (popped) from the top. No plate can be taken from the middle or the bottom, exemplifying a Last-In, First-Out (LIFO) operation.

Utilizing Arrays as Stacks in JavaScript

To create a stack, JavaScript employs a built-in data structure known as an Array . For the Push operation, we use push(), which adds an element at the array's end. For the Pop operation, there's the pop() function that removes the last element, simulating the removal of the 'top' element in a stack. Here's how it looks: JavaScript let stack = []; // A new empty stack // Push operations stack.push('John'); stack.push('Mary'); stack.push('Steve'); stack.pop(); // Pop operation removes 'Steve' console.log(stack); // Outputs: ['John', 'Mary'] In the example provided, we push'John','Mary', and'Steve' into the stack and then pop'Steve' from the stack.

Additional Stack Operations

Stacks' operations go beyond merely push and pop . For example, to verify if a stack is empty, we can use the length property. If it returns 0, that means the stack is empty. Conversely, if it returns a nonzero value, we can infer the stack is not empty. To peek at the top element of the stack without popping it, merely indexing with stack[stack.length - 1] is handy. Here's an example: JavaScript stack.push('Sam'); console.log(stack[stack.length - 1]); // Outputs: 'Sam' In this example,'Sam' is added (pushed), and then the topmost stack element, which is'Sam', is peeked at.

Join the 1M+ learners on CodeSignal

Be a part of our community of 1M+ users who develop and demonstrate their skills on CodeSignal

Practical Stack Applications: Checking Balance of Parentheses

A stack can be utilized to verify if parentheses in an expression are well-matched, i.e., every bracket has a corresponding pair. For example, parentheses in the string "()[{}]" are well-matched, while in the strings "([]()", ")()[]{}", "([)]", and "[{})" they are not.

Let's break down the solution into simple steps:

We start by creating an object that maps each closing bracket to its corresponding opening bracket and an empty stack. Then, we iterate over each character paren in the string parenString:

If paren is an opening bracket, it gets appended to the stack.
If paren is a closing bracket and the top element in the stack is the corresponding opening bracket, we remove the top element from the stack.
If neither of the above conditions is met, we return false.

Finally, if the stack is empty (all opening brackets had matching closing brackets), we return true. If there are some unmatched opening brackets left, we return false.

JavaScript

function isParenBalanced(parenString) {
    let stack = [];
    let isBalanced = true;
    let index = 0;
    const openingParen = {')': '(', ']': '[', '}': '{'}; // a matching opening parenthesis for every closing one

    // Traversing all string characters
    while (index < parenString.length && isBalanced) {
        let paren = parenString[index];
        if (paren in openingParen) {
            if (stack.length === 0 || stack[stack.length - 1] !== openingParen[paren]) {
                isBalanced = false;
            } else {
                stack.pop();
            }
        } else if ("([{".includes(paren)) {
            stack.push(paren);
        }
        index++;
    }

    if (stack.length !== 0) {
        // If after traversing all characters, there is something left, it's bad
        isBalanced = false;
    }
    return isBalanced;
}

console.log(isParenBalanced("(())")); // Outputs: true
console.log(isParenBalanced("({[)}")); // Outputs: false

function isParenBalanced(parenString) {
    let stack = [];
    let isBalanced = true;
    let index = 0;
    const openingParen = {')': '(', ']': '[', '}': '{'}; // a matching opening parenthesis for every closing one

    // Traversing all string characters
    while (index < parenString.length && isBalanced) {
        let paren = parenString[index];
        if (paren in openingParen) {
            if (stack.length === 0 || stack[stack.length - 1] !== openingParen[paren]) {
                isBalanced = false;
            } else {
                stack.pop();
            }
        } else if ("([{".includes(paren)) {
            stack.push(paren);
        }
        index++;
    }

    if (stack.length !== 0) {
        // If after traversing all characters, there is something left, it's bad
        isBalanced = false;
    }
    return isBalanced;
}

console.log(isParenBalanced("(())")); // Outputs: true
console.log(isParenBalanced("({[)}")); // Outputs: false