7 kyu
Frequency sequence
1,759 of 5,009bitfragment
Description:
Your task is to return an output string that translates an input string s
by replacing each character in s
with a number representing the number of times that character occurs in s
and separating each number with the sep
character(s).
Example (s, sep --> Output)
"hello world", "-" --> "1-1-3-3-2-1-1-2-1-3-1"
"19999999" , ":" --> "1:7:7:7:7:7:7:7"
"^^^**$" , "x" --> "3x3x3x2x2x1"
Strings
Fundamentals
Similar Kata:
Stats:
Created | Dec 21, 2016 |
Published | Dec 27, 2016 |
Warriors Trained | 7120 |
Total Skips | 244 |
Total Code Submissions | 12251 |
Total Times Completed | 5009 |
JavaScript Completions | 1759 |
Python Completions | 2125 |
Haskell Completions | 111 |
Ruby Completions | 227 |
PHP Completions | 280 |
Rust Completions | 243 |
TypeScript Completions | 178 |
C Completions | 57 |
Go Completions | 265 |
COBOL Completions | 6 |
Total Stars | 86 |
% of votes with a positive feedback rating | 93% of 830 |
Total "Very Satisfied" Votes | 731 |
Total "Somewhat Satisfied" Votes | 87 |
Total "Not Satisfied" Votes | 12 |
Total Rank Assessments | 11 |
Average Assessed Rank | 7 kyu |
Highest Assessed Rank | 7 kyu |
Lowest Assessed Rank | 8 kyu |