Collatz Sequence Steps

The Collatz conjecture defines a process for any positive integer n:

• If n is even, replace n with n / 2
• If n is odd, replace n with 3 * n + 1

Repeat until n becomes 1. Count the number of steps it takes.

Follow-up: If this method is called many times, how would you optimize? (Use memoization to cache results)