문제풀이20 [CodeWars] javascript - 6kyu - Replace With Alphabet Position 문제풀이 Title Replace With Alphabet Position DescriptionWelcome. In this kata you are required to, given a string, replace every letter with its position in the alphabet. If anything in the text isn't a letter, ignore it and don't return it. "a" = 1, "b" = 2, etc. Example alphabetPosition("The sunset sets at twelve o' clock.") Should return "20 8 5 19 21 14 19 5 20 19 5 20 19 1 20 20 23 5 12.. 2020. 4. 29. [CodeWars] javascript - 7kyu - Largest 5 digit number in a series 문제풀이 Title Largest 5 digit number in a series Description Description: In the following 6 digit number: 283910 91 is the greatest sequence of 2 consecutive digits. In the following 10 digit number: 1234567890 67890 is the greatest sequence of 5 consecutive digits. Complete the solution so that it returns the greatest sequence of five consecutive digits found within the number given. The number will b.. 2020. 4. 24. [CodeWars] javascript - 8kyu - Find the first non-consecutive number 문제풀이 Title Find the first non-consecutive number Description Your task is to find the first element of an array that is not consecutive. By not consecutive we mean not exactly 1 larger than the previous element of the array. E.g. If we have an array [1,2,3,4,6,7,8] then 1 then 2 then 3 then 4 are all consecutive but 6 is not, so that's the first non-consecutive number. If the whole array is consecuti.. 2020. 4. 13. [CodeWars] javascript - 6kyu - Sum of Digits / Digital Root 문제풀이 Title Sum of Digits / Digital Root Description In this kata, you must create a digital root function. A digital root is the recursive sum of all the digits in a number. Given n, take the sum of the digits of n. If that value has more than one digit, continue reducing in this way until a single-digit number is produced. This is only applicable to the natural numbers. Here's how it works: digital_.. 2020. 4. 12. 이전 1 2 3 4 5 다음 반응형