Valid Parenthesis LeetCode Algorithim

ValidParn.js

// /**
//  * @param {string} s
//  * @return {boolean}
//  */
let brackets = {
    "(": ")",
    "[": "]",
    "{": "}",
};

var isValid = function(s) {
    let stack = [];
    for (let i = 0; i < s.length; i++) {
        let currentParen = s[i];
        let closingParen = brackets[currentParen];
        
        if (closingParen) stack.push(closingParen);
        else if (currentParen !== stack.pop()) return false;
        
    }
    return !stack.length; // true when stack is empty, false otherwise
};

/* 1- Create Object to reference closing parenthesis
   2- Create Stack for closing parens
   3- loop through array
   4- set variable for current paren
   5-set variable for closed paren
   6- if closing paren exists push it onto stack
   7-if not and current value does not equal value in stack return false;
   8- if stack is empty return true otherwise return false