My question: "How many ways are there to construct a string of $3$ digits if numbers cannot be repeated?"
After a few days of scratching head, I still have no idea how to solve it. May anyone give a hint to help me think through and keep going to the answer, please?
Thanks for your time!