12. Tower of Hanoi (list the moves)
EasyRecursion & backtracking
Move n disks from peg "A" to peg "C" using peg "B", never placing a larger disk on a smaller one. Return the moves as strings like "A->C", in order.
Example 1
Input: n = 2 Output: ["A->B", "A->C", "B->C"]
Constraints
1 ≤ n ≤ 10