PracHub
QuestionsPremiumLearningGuidesInterview PrepNEWCoaches
|Home/Coding & Algorithms/Meta

Evaluate arithmetic expression without using extra stack

Last updated: Mar 29, 2026

Quick Overview

This question evaluates a candidate's ability to perform in-place arithmetic expression evaluation, focusing on string parsing, handling multi-digit numbers and whitespace, operator precedence, integer division semantics, and designing O(n) time with O(1) extra space solutions in the Coding & Algorithms domain.

  • Medium
  • Meta
  • Coding & Algorithms
  • Software Engineer

Evaluate arithmetic expression without using extra stack

Company: Meta

Role: Software Engineer

Category: Coding & Algorithms

Difficulty: Medium

Interview Round: Technical Screen

Write a function to evaluate a string expression consisting of non-negative integers and the operators +, -, *, and / (integer division truncates toward zero). Process the string in one left-to-right pass in O(n) time and O( 1) extra space—do not use a stack or recursion. Explain how you track the last term and aggregated result to handle operator precedence without auxiliary data structures, and analyze edge cases like spaces and multi-digit numbers.

Quick Answer: This question evaluates a candidate's ability to perform in-place arithmetic expression evaluation, focusing on string parsing, handling multi-digit numbers and whitespace, operator precedence, integer division semantics, and designing O(n) time with O(1) extra space solutions in the Coding & Algorithms domain.

Related Interview Questions

  • Solve Tree Columns And Maze Variants - Meta (medium)
  • Solve a Key-Door Corridor Maze - Meta (medium)
  • Solve Array Merge and Parentheses Cleanup - Meta (medium)
  • Solve Two Backtracking Array Problems - Meta (hard)
  • Solve Maze and Suffix Problems - Meta (medium)
Meta logo
Meta
Sep 6, 2025, 12:00 AM
Software Engineer
Technical Screen
Coding & Algorithms
2
0

Write a function to evaluate a string expression consisting of non-negative integers and the operators +, -, *, and / (integer division truncates toward zero). Process the string in one left-to-right pass in O(n) time and O(

  1. extra space—do not use a stack or recursion. Explain how you track the last term and aggregated result to handle operator precedence without auxiliary data structures, and analyze edge cases like spaces and multi-digit numbers.

Comments (0)

Sign in to leave a comment

Loading comments...

Browse More Questions

More Coding & Algorithms•More Meta•More Software Engineer•Meta Software Engineer•Meta Coding & Algorithms•Software Engineer Coding & Algorithms
PracHub

Master your tech interviews with 7,500+ real questions from top companies.

Product

  • Questions
  • Learning Tracks
  • Interview Guides
  • Resources
  • Premium
  • For Universities
  • Student Access

Browse

  • By Company
  • By Role
  • By Category
  • Topic Hubs
  • SQL Questions
  • Compare Platforms
  • Discord Community

Support

  • support@prachub.com
  • (916) 541-4762

Legal

  • Privacy Policy
  • Terms of Service
  • About Us

© 2026 PracHub. All rights reserved.