解题三板斧

1. Recursion
   1. Divide the problem with n elements into 2 subproblems (n-1) and 1. The subproblem that deals with 1 element is the base case.
2. Sorting
3. Reverse (Stack)