How many recursive-descent interview questions are there?

1 reported question, mostly Coding & Leetcode-style Questions.

How hard are recursive-descent questions?

They average 3.0 out of 5: 1 at 3/5.

recursive-descent Interview Questions

1 interview question in our bank covers recursive-descent, most of them Coding & Leetcode-style Questions. They average 3.0/5 difficulty — medium — and each one was reported by a candidate after a real interview. Companies known to ask about recursive-descent: Uber.

Practice these on the problems board →

Companies that ask about recursive-descent

Uber1

Question mix

Coding & Leetcode-style Questions1

Difficulty

3/5 — medium1

Questions tagged recursive-descent

Nested Add/Sub Expression Evaluator
3/5
This Uber interview question tests your ability to design a custom parser and evaluator for hierarchically structured arithmetic expressions containing nested operations. You must build a robust algorithm that handles operator precedence, whitespace variations, and function-style syntax without relying on built-in evaluation tools. The problem challenges your recursive parsing skills and understanding of grammar structures used in compilers. Read the full problem specification, edge case analysis, and complete reference solution with an active subscription.
Coding & Leetcode-style QuestionsUber

recursive-descent interview FAQ

How many recursive-descent interview questions are there?: 1 reported question, mostly Coding & Leetcode-style Questions.
Which companies ask recursive-descent questions?: Uber (1).
How hard are recursive-descent questions?: They average 3.0 out of 5: 1 at 3/5.

Companies that ask about recursive-descent

Question mix

Difficulty

Questions tagged recursive-descent

Nested Add/Sub Expression Evaluator

recursive-descent interview FAQ