Flipkart interview

[Somasree (Somasree Majumder)]

In Tower of Hanoi, we can only move those discs from rod A to C or vice – versa which has a width greater than the width of the disc at the top of rod B. Find the minimum number of operation required to shift N discs. ( I was not able to find an optimal answer for it)
Please help me to solve this

[aman212yadav (Aman Yadav)]

hello @Somasree

@Somasree

In Tower of Hanoi, we can only move those discs from rod A to C or vice – versa which has a width greater than the width of the disc at the top of rod B. Find the minimum number of operation required to shift N discs.

please share the complete question. this satement is ambiguos. and few details are missing .
also if sample test case and explanation are given then share them too