René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/ternary-expression-parser","name":"#439 - Ternary Expression Parser - LeetCode JavaScript Solutions","description":"Given a string expression representing arbitrarily nested ternary expressions, evaluate the expression, and return the result of it. You can...","programmingLanguage":"JavaScript","codeRepository":"https://github.com/JoshCrozier/leetcode-javascript","codeSampleType":"JavaScript","text":"/**\n * @param {string} expression\n * @return {string}\n */\nvar parseTernary = function(expression) {\n const stack = [];\n\n for (let i = expression.length - 1; i >= 0; i--) {\n const char = expression[i];\n if (char !== ':' && char !== '?') {\n stack.push(char);\n } else if (char === '?') {\n const condition = expression[i - 1];\n const trueValue = stack.pop();\n const falseValue = stack.pop();\n stack.push(condition === 'T' ? trueValue : falseValue);\n i--;\n }\n }\n\n return stack[0];\n};","keywords":"LeetCode 439, #439 - Ternary Expression Parser, Medium, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}