Meta tags:
description= You are given a string expression representing a Lisp-like expression to return the integer value of. The syntax for these expressions is gi...;
keywords= leetcode, javascript, solutions, algorithms, data structures, coding, programming, coding challenges, coding problems, coding solutions;
author= LeetCodeJavascript.com;
Headings (most frequently used words):
736, parse, lisp, expression, problem, description, solution,
Text of the page (most frequently used words):
the (32), #expression (20), tokens (12), parse (10), scope (10), let (10), and (10), return (9), exp (8), variable (8), add (7), mult (7), for (7), string (6), result (6), value (6), are (6), always (6), current (5), char (5), evaluation (5), expressions (5), const (4), newscope (4), depth (4), there (4), that (4), then (4), integer (4), function (3), more (3), names (3), takes (3), form (3), where (3), assigned (3), lisp (3), leetcodejavascript (2), com (2), evaluate (2), new (2), map (2), tokenize (2), length (2), push (2), checked (2), first (2), sequentially (2), this (2), will (2), lowercase (2), two (2), expr (2), given (2), view (2), github (2), leetcode (2), 736 (2), solutions (2), 2025, josh, crozier, param, number, var, isnan, parseint, startswith, get, slice, set, else, solution, finally, concept, when, name, evaluated, within, context, innermost, terms, parentheses, outer, scopes, guaranteed, every, legal, please, see, examples, details, question, use, smaller, subset, starts, with, letter, zero, letters, digits, additionally, your, convenience, protected, never, used, multiplication, addition, one, pairs, alternating, variables, meaning, second, could, positive, negative, either, single, syntax, these, follows, you, representing, like, problem, description, recursion, stack, hash, table, hard, back, all, star, javascript,
Text of the page (random words):
736 parse lisp expression leetcode javascript solutions leetcodejavascript com star on github back to all solutions 736 parse lisp expression hard view on leetcode view on github string hash table stack recursion problem description you are given a string expression representing a lisp like expression to return the integer value of the syntax for these expressions is given as follows an expression is either an integer let expression add expression mult expression or an assigned variable expressions always evaluate to a single integer an integer could be positive or negative a let expression takes the form let v1 e1 v2 e2 vn en expr where let is always the string let then there are one or more pairs of alternating variables and expressions meaning that the first variable v1 is assigned the value of the expression e1 the second variable v2 is assigned the value of the expression e2 and so on sequentially and then the value of this let expression is the value of the expression expr an add expression takes the form add e1 e2 where add is always the string add there are always two expressions e1 e2 and the result is the addition of the evaluation of e1 and the evaluation of e2 a mult expression takes the form mult e1 e2 where mult is always the string mult there are always two expressions e1 e2 and the result is the multiplication of the evaluation of e1 and the evaluation of e2 for this question we will use a smaller subset of variable names a variable starts with a lowercase letter then zero or more lowercase letters or digits additionally for your convenience the names add let and mult are protected and will never be used as variable names finally there is the concept of scope when an expression of a variable name is evaluated within the context of that evaluation the innermost scope in terms of parentheses is checked first for the value of that variable and then outer scopes are checked sequentially it is guaranteed that every expression is legal please see the examples for more details on the scope solution param string expression return number var evaluate function expression return parse expression new map function parse exp scope if isnan exp return parseint exp if exp startswith return scope get exp 0 const tokens tokenize exp slice 1 1 if tokens 0 add return parse tokens 1 scope parse tokens 2 scope if tokens 0 mult return parse tokens 1 scope parse tokens 2 scope const newscope new map scope for let i 1 i tokens length 1 i 2 newscope set tokens i parse tokens i 1 newscope return parse tokens tokens length 1 newscope function tokenize exp const result let current let depth 0 for const char of exp if char depth 0 result push current current else current char if char depth if char depth result push current return result 2025 leetcodejavascript com josh crozier
|