Retired
Permutations (retired)
Description:
Task:
Write a function that will find out how many unique ways there are to order a certain amount of letters from a given string.
The length value will never be larger than the length of the word.
Example:
How many ways are there to order four letters from the word "formula"? The answer is 840.
Mathematics
Algorithms
Similar Kata:
Stats:
| Created | Jun 19, 2023 |
| Warriors Trained | 20 |
| Total Skips | 0 |
| Total Code Submissions | 22 |
| Total Times Completed | 8 |
| Python Completions | 8 |
| Total Stars | 1 |
| % of votes with a positive feedback rating | 36% of 7 |
| Total "Very Satisfied" Votes | 1 |
| Total "Somewhat Satisfied" Votes | 3 |
| Total "Not Satisfied" Votes | 3 |
| Total Rank Assessments | 6 |
| Average Assessed Rank | 7 kyu |
| Highest Assessed Rank | 7 kyu |
| Lowest Assessed Rank | 8 kyu |
