How should I practice Parse Variable, Expression, and Application Trees?

Start by reading the full statement, solve the visible examples, then compare the pattern against related SambaNova Systems phone screen and onsite interview problems in FastPrep.

Is Parse Variable, Expression, and Application Trees associated with SambaNova Systems?

FastPrep tags this as a SambaNova Systems phone screen and onsite interview coding practice problem when the problem catalog has that company and stage context.

Parse Variable, Expression, and Application Trees

SambaNova Systems● MediumFULLTIMENEW GRADPHONE SCREENONSITE INTERVIEW

Learn

Problem statement

Parse one valid nested expression into a canonical tree string.

An identifier becomes Variable(name).
Comma-separated children in parentheses become Expression(child1,...).
Comma-separated children in square brackets become Application(child1,...).

Whitespace may surround tokens and commas. Each group has at least one child. Return the canonical representation without spaces.

Function

parseExpressionTree(text: String) → String

Examples

Example 1

text = "(x,(x,y))"return = "Expression(Variable(x),Expression(Variable(x),Variable(y)))"

The nested parentheses produce nested Expression nodes.

Example 2

text = "[f,(x,y)]"return = "Application(Variable(f),Expression(Variable(x),Variable(y)))"

Square brackets create an Application node.

Example 3

text = "value_1"return = "Variable(value_1)"

A lone identifier is a Variable.

Constraints

1 <= text.length <= 10000.
Identifiers contain ASCII letters, digits, and underscore and begin with a letter.
The input is syntactically valid, has one root, and nesting depth is at most 500.