Lonpeach Tech

게임 개발 이슈 정리

[Codewars #62] Exes and Ohs (7kyu)

[Codewars #62] Exes and Ohs (7kyu) 문제 풀이

Instructions 링크 Check to see if a string has the same amount of ‘x’s and ‘o’s. The method must return a boolean and be case insensitive. The string can contain any char. Examples input/output: ...

[Codewars #61] Maximum subarray sum (5kyu)

[Codewars #61] Maximum subarray sum (5kyu) 문제 풀이

Instructions 링크 The maximum sum subarray problem consists in finding the maximum sum of a contiguous subsequence in an array or list of integers: 1 2 maxSequence [-2, 1, -3, 4, -1, 2, 1, -5, 4] ...

[Codewars #60] Basic Mathematical Operations (8kyu)

[Codewars #60] Basic Mathematical Operations (8kyu) 문제 풀이

Instructions 링크 Your task is to create a function that does four basic mathematical operations. The function should take three arguments - operation(string/char), value1(number), value2(number)....

[Codewars #59] Double Char (8kyu)

[Codewars #59] Double Char (8kyu) 문제 풀이

Instructions 링크 Given a string, you have to return a string in which each character (case-sensitive) is repeated once. 1 2 3 4 5 DoubleChar("String") == "SSttrriinngg" DoubleChar("Hello World")...

[Codewars #58] Take a Number And Sum Its Digits Raised To The Consecutive Powers And ....¡Eureka!! (6kyu)

[Codewars #58] Take a Number And Sum Its Digits Raised To The Consecutive Powers And ....¡Eureka!! (6kyu) 문제 풀이

Instructions 링크 The number 89 is the first integer with more than one digit that fulfills the property partially introduced in the title of this kata. What’s the use of saying “Eureka”? Because t...

[Codewars #57] Rock Paper Scissors! (8kyu)

[Codewars #57] Rock Paper Scissors! (8kyu) 문제 풀이

Instructions 링크 Rock Paper Scissors Let’s play! You have to return which player won! In case of a draw return Draw!. Examples: 1 2 3 rps('scissors','paper') // Player 1 won! rps('scissors','rock...

[Codewars #56] Remove First and Last Character (8kyu)

[Codewars #56] Remove First and Last Character (8kyu) 문제 풀이

Instructions 링크 It’s pretty straightforward. Your goal is to create a function that removes the first and last characters of a string. You’re given one parameter, the original string. You don’t h...

[Codewars #55] Convert number to reversed array of digits (8kyu)

[Codewars #55] Convert number to reversed array of digits (8kyu) 문제 풀이

Instructions 링크 Convert number to reversed array of digits Given a random number: C#: long; C++: unsigned long; You have to return the digits of this number within an array in reverse order. Ex...

[Codewars #54] Delete occurrences of an element if it occurs more than n times (6kyu)

[Codewars #54] Delete occurrences of an element if it occurs more than n times (6kyu) 문제 풀이

Instructions 링크 Enough is enough! Alice and Bob were on a holiday. Both of them took many pictures of the places they’ve been, and now they want to show Charlie their entire collection. However, ...

[Codewars #53] List Filtering (7kyu)

[Codewars #53] List Filtering (7kyu) 문제 풀이

Instructions 링크 In this kata you will create a function that takes a list of non-negative integers and strings and returns a new list with the strings filtered out. Example 1 2 3 ListFilterer.Ge...