Product
Pricing
Blog
Forum
NEW
Referral
Description
Solution
Discussion
Submissions
Ask AI
AI Insights
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
Collapse
Hint 1
Hint 2
What Interviewers May Ask Next
Report
Report seen similar question in interview
Ask AI Assistant
Ask AI Assistant
Ask me anything about this coding question!
python
Auto
Debug
Run
Submit
Test Cases
Input
Output
Expected
