DoorDash E5 Phone Screening - USA (Passed)
Question Details
1h interview I was asked: https://leetcode.com/problems/basic-calculator-ii/ with a
followup https://leetcode.com/problems/basic-calculator-iii I did the first problem quickly but messed up the if statement, so it took me 15min to figure out my mistake... Was...
Full Details
1h interview
I was asked: https://leetcode.com/problems/basic-calculator-ii/
with a
followup https://leetcode.com/problems/basic-calculator-iii
I did the first problem quickly but messed up the if statement, so it took me 15min to figure out my mistake...
Was then asked to "pseudo/skeleton code" the 2nd question since I only had 10 minutes left. (I said to use recursion with the 1st problem\'s function, but i think they were expecting a stack solution like in the editorial...)
I don\'t think it will be enough to pass tbh, but will update when I hear back results.
Update:
I moved on to onsite
About This Question
This is a reported interview question from a doordash interview for a swe role (senior level) during the phone screen round reported in 2025.
It covers the following topics: Recursion, Stack .
Difficulty rating: Easy