A clerk is given 3 letters written in a language unknown to her. She is also given an envelope with an address corresponding to each letter written in the same language. If the clerk puts the letters in the envelopes, in how many ways can she do it so that none of the 3 envelopes contains the letter with the correct address?
Competitive Examination Permutations and Combinations — FAQ
How many Permutations and Combinations questions come in Competitive Examination?▼
Our database has 1 Permutations and Combinations questions from Competitive Examination covering 2026 to 2026.
What difficulty are Competitive Examination Permutations and Combinations questions?▼
The 1 Competitive Examination Permutations and Combinations questions include 0 easy, 1 medium and 0 hard level questions.
Where can I find more Permutations and Combinations questions for other exams?▼
Visit /tag/permutations-and-combinations to see all Permutations and Combinations questions across all exams including Competitive Exam, Practice Test, AIEEE.