Practice Affirm Coding Question | Real Coding Interviews | Hack2hire

NewML System Design & SQL tracks just landedSee what's new

Question Bank Pricing Blog Forum

Quick Summary

Evaluate a nested mathematical expression containing only 'add' and 'mul' operations.
The input uses a prefix-like notation wrapped in parentheses for explicit grouping.
Requires splitting the string into tokens and recursively processing sub-expressions.

What This Tests

Recursive descent parsing and token handling
Managing state across nested scopes without explicit stacks
String manipulation and boundary condition tracking
Evaluating expressions with uniform operator precedence per group

Common Patterns

DFS/BFS

Divide and Conquer

Test Cases

Input

Output

Expected