java 검색 결과
11 개의 검색 결과가 있습니다.
IT Contents/프로그래밍 팁

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` ..

2021. 4. 8. 07:00
IT Contents/프로그래밍 팁

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..

2021. 4. 7. 07:00
IT Contents/프로그래밍 팁

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..

2021. 4. 6. 07:00
IT Contents/프로그래밍 팁

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..

2021. 4. 5. 07:00
IT Contents/프로그래밍 팁

Create Phone Number, CodeWars Kata 자바 솔루션

Create Phone Number, CodeWars Kata Write a function that accepts an array of 10 integers (between 0 and 9), that returns a string of those numbers in the form of a phone number. Example: Kata.createPhoneNumber(new int[] {1, 2, 3, 4, 5, 6, 7, 8, 9, 0}) // => returns "(123) 456-7890" The returned format must be correct in order to complete this challenge. Don't forget the space after the closing p..

2021. 4. 4. 07:00
IT Contents/프로그래밍 팁

Find the missing letter, CodeWars Kata 자바 솔루션

Find the missing letter, CodeWars Kata #Find the missing letter Write a method that takes an array of consecutive (increasing) letters as input and that returns the missing letter in the array. You will always get an valid array. And it will be always exactly one letter be missing. The length of the array will always be at least 2. The array will always contain letters in only one case. Example:..

2021. 4. 3. 07:00