Recursive Stack Reversal | Dataford Interview Questions

Given a stack implemented using a linked list and functions push(int), pop(), and isEmpty(), write a recursive function to reverse the contents of the stack without using loops.

For grading, represent the stack as a Python list in bottom-to-top order, where the last element is the top. The function must mutate and return this list, use recursion only, and preserve duplicate and negative values.

Constraints

0 <= len(stack) <= 100
-10^9 <= stack[i] <= 10^9
The stack must be reversed in place.
Loops and auxiliary stacks are not allowed.

Function Signature

def reverse_stack(stack):

Your question is Recursive Stack Reversal. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Given a stack implemented using a linked list and functions push(int), pop(), and isEmpty(), write a recursive function to reverse the contents of the stack without using loops.

Constraints

0 <= len(stack) <= 100
-10^9 <= stack[i] <= 10^9
The stack must be reversed in place.
Loops and auxiliary stacks are not allowed.

Function Signature

def reverse_stack(stack):

Your question is Recursive Stack Reversal. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.