Draft
Check Permutation
16nramirez
Description:
Given two strings, decide if one is a permutation of the other.
Example
S1 = 'banana'
S2 = 'nabana'
result = true
Note
You can assume that all the test cases will only use letters in the English alphabet
Permutations
Algorithms
Fundamentals
Similar Kata:
Stats:
Created | Sep 30, 2019 |
Warriors Trained | 20 |
Total Skips | 0 |
Total Code Submissions | 39 |
Total Times Completed | 16 |
JavaScript Completions | 16 |
Total Stars | 0 |
% of votes with a positive feedback rating | 18% of 11 |
Total "Very Satisfied" Votes | 1 |
Total "Somewhat Satisfied" Votes | 2 |
Total "Not Satisfied" Votes | 8 |
Total Rank Assessments | 12 |
Average Assessed Rank | 7 kyu |
Highest Assessed Rank | 7 kyu |
Lowest Assessed Rank | 8 kyu |