Counting Strategies: Casework, Complementary & Overcounting · Easy problem

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