In the Tower of Hanoi problem with 3 rods (1, 2 & 3), the goal is to move a tower of disks from rod #1 to rod #2. You can move disks only one by one, on the rods. You can't put a disk on a smaller one.
At the beginning, all disks are on rod #1, biggest at the bottom, smallest at the top.
Give the number of moves necessary to solve the problem.
Determine whether a vector is monotonically increasing
8557 Solvers
1676 Solvers
731 Solvers
Check if number exists in vector
1776 Solvers
Sum the entries of each column of a matrix which satisfy a logical condition.
103 Solvers
Tags