Hack The Stack
CodeChefOpen on judge ↗
Harshad has two stacks X and Y containing x and y number of disks respectively. He wants to transfer all the disks to a single stack A of size x+y. He picks a disk from top of the stack X or Y, provided the stack is not empty, and pushes it on the top of stack A. He does this till all the disks are not transferred. Your task is to find out the number of ways in which the transfer can be done. Two
HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17
CodeSearch Tutor
Hints, not spoilers — it won’t hand over the full solution unless you insist.
Sign in to chat with the tutor and save your progress.
Sign in to start