CodingHardcod-g612

Subject String parsingLevel Mid–Senior~35 minCommon in Algorithms & data structures interviewsIndustries Software development

Question

Implement a basic calculator that evaluates a string expression containing non-negative integers, '+', '-', '*', '/', spaces, and parentheses. Integer division truncates toward zero. The expression is always valid; assume the result and all intermediate values fit in a signed 64-bit integer. 1 <= len(s) <= 100000. Example: '2*(5+5*2)/3+(6/2+8)' -> 21.

Implement

calculate(s: str) → int

Examples

in["2*(5+5*2)/3+(6/2+8)"]out21

What a strong answer looks like

State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.

Learn the concepts

Vibe coding: describe the solution in plain language (or narrate it) and the coach grades your approach. Generating runnable code from your description is coming next.

Run or narrate your approach, then ask the coach.