Counting Duplicates, CodeWars Kata 자바 솔루션
Counting Duplicates, CodeWars Kata Count the number of Duplicates Write a function that will return the count of distinct case-insensitive alphabetic characters and numeric digits that occur more than once in the input string. The input string can be assumed to contain only alphabets (both uppercase and lowercase) and numeric digits. Example "abcde" -> 0 `# no characters repeats more than once` ..
Convert string to camel case, CodeWars Kata 자바 솔루션
Convert string to camel case, CodeWars Kata Complete the method/function so that it converts dash/underscore delimited words into camel casing. The first word within the output should be capitalized only if the original word was capitalized (known as Upper Camel Case, also often referred to as Pascal case). Examples "the-stealth-warrior"` gets converted to `"theStealthWarrior"` `"The_Stealth_War..
Number of trailing zeros of N!, CodeWars Kata 자바 솔루션
Number of trailing zeros of N!, CodeWars Kata Write a program that will calculate the number of trailing zeros in a factorial of a given number. N! = 1 * 2 * 3 * ... * N Be careful 1000! has 2568 digits... For more info, see: http://mathworld.wolfram.com/Factorial.html Examples zeros(6) = 1 # 6! = 1 * 2 * 3 * 4 * 5 * 6 = 720 --> 1 trailing zero zeros(12) = 2 # 12! = 479001600 --> 2 trailing zero..
Human Readable Time, CodeWars Kata 자바 솔루션
Human Readable Time, CodeWars Kata Write a function, which takes a non-negative integer (seconds) as input and returns the time in a human-readable format (HH:MM:SS) HH = hours, padded to 2 digits, range: 00 - 99 MM = minutes, padded to 2 digits, range: 00 - 59 SS = seconds, padded to 2 digits, range: 00 - 59 The maximum time never exceeds 359999 (99:59:59) You can find some examples in the test..