Counting Strategies: Casework, Complementary & Overcounting · Easy problem

How many strings of length $2$ can be formed from $5$ symbols if no symbol may repeat?