Lonpeach Tech

게임 개발 이슈 정리

[Codewars #39] Paul Cipher & Kevin Arnold (5kyu)

[Codewars #39] Paul Cipher & Kevin Arnold (5kyu) 문제 풀이

Instructions 링크 We need to encode a message. Only alpha characters will be encoded. Non-alpha characters will be copied. So, the message “ 0123. “ would be encoded to “ 0123. “. For alpha chara...

[Codewars #38] Play with two Strings (5kyu)

[Codewars #38] Play with two Strings (5kyu) 문제 풀이

Instructions 링크 Your task is to Combine two Strings. But consider the rule… By the way you don’t have to check errors or incorrect input values, every thing is ok without bad tricks, only two in...

[Codewars #37] Maze Runner (6kyu)

[Codewars #37] Maze Runner (6kyu) 문제 풀이

Instructions 링크 Introduction 1 Welcome Adventurer. Your aim is to navigate the maze and reach the finish point without touching any walls. Doing so will kill you instantly! Maze Runner Task ...

[Codewars #36] Basic DeNico (5kyu)

[Codewars #36] Basic DeNico (5kyu) 문제 풀이

Instructions 링크 Description: Task Write a function deNico/de_nico() that accepts two parameters: key/$key - string consists of unique letters and digits message/$message - string with encod...

[Codewars #35] Street Fighter 2 - Character Selection (6kyu)

[Codewars #35] Street Fighter 2 - Character Selection (6kyu) 문제 풀이

Instructions 링크 Short Intro Some of you might remember spending afternoons playing Street Fighter 2 in some Arcade back in the 90s or emulating it nowadays with the numerous emulators for retro ...

[Codewars #34] Reverse or rotate? (6kyu)

[Codewars #34] Reverse or rotate? (6kyu) 문제 풀이

Instructions 링크 The input is a string str of digits. Cut the string into chunks (a chunk here is a substring of the initial string) of size sz (ignore the last chunk if its size is less than sz)....

[Codewars #33] String tops (6kyu)

[Codewars #33] String tops (6kyu) 문제 풀이

Instructions 링크 Task Write a function that accepts msg string and returns local tops of string from the highest to the lowest. The string’s tops are from displaying the string in the below way: ...

[Codewars #32] Persistent Bugger (6kyu)

[Codewars #32] Persistent Bugger (6kyu) 문제 풀이

Instructions Write a function, persistence, that takes in a positive parameter num and returns its multiplicative persistence, which is the number of times you must multiply the digits in num unti...

[Codewars #31] Build a pile of Cubes (6kyu)

[Codewars #31] Build a pile of Cubes (6kyu) 문제 풀이

Instructions Your task is to construct a building which will be a pile of n cubes. The cube at the bottom will have a volume of n^3, the cube above will have volume of (n-1)^3 and so on until the ...

[Codewars #30] Playing with digits (6kyu)

[Codewars #30] Playing with digits (6kyu) 문제 풀이

Instructions Some numbers have funny properties. For example: 1 2 3 4 5 89 --> 8¹ + 9² = 89 * 1 695 --> 6² + 9³ + 5⁴= 1390 = 695 * 2 46288 --> 4³ + 6⁴+ 2⁵ + 8⁶ + 8⁷ = 2360688 = 46288 *...