Lonpeach Tech

게임 개발 이슈 정리

[Codewars #52] Ones and Zeros (7kyu)

[Codewars #52] Ones and Zeros (7kyu) 문제 풀이

Instructions 링크 Given an array of one’s and zero’s convert the equivalent binary value to an integer. Eg: [0, 0, 0, 1] is treated as 0001 which is the binary representation of 1. Examples: 1 2 ...

[Codewars #51] Consecutive strings (6kyu)

[Codewars #51] Consecutive strings (6kyu) 문제 풀이

Instructions 링크 You are given an array strarr of strings and an integer k. Your task is to return the first longest string consisting of k consecutive strings taken in the array. Example: longes...

[Codewars #50] Is this a triangle? (7kyu)

[Codewars #50] Is this a triangle? (7kyu) 문제 풀이

Instructions 링크 Implement a method that accepts 3 integer values a, b, c. The method should return true if a triangle can be built with the sides of given length and false in any other case. (In...

[Codewars #49] Take a Ten Minute Walk (6kyu)

[Codewars #49] Take a Ten Minute Walk (6kyu) 문제 풀이

Instructions 링크 You live in the city of Cartesia where all roads are laid out in a perfect grid. You arrived ten minutes too early to an appointment, so you decided to take the opportunity to go ...

[Codewars #48] Grasshopper - Summation (8kyu)

[Codewars #48] Grasshopper - Summation (8kyu) 문제 풀이

Instructions 링크 Write a program that finds the summation of every number from 1 to num. The number will always be a positive integer greater than 0. For example: 1 2 3 4 5 summation(2) -> 3 1...

[Codewars #47] Alphabet war - Wo lo loooooo priests join the war (5kyu)

[Codewars #47] Alphabet war - Wo lo loooooo priests join the war (5kyu) 문제 풀이

Instructions 링크 There is a war and nobody knows - the alphabet war! There are two groups of hostile letters. The tension between left side letters and right side letters was too high and the war ...

[Codewars #46] Mixbonacci (5kyu)

[Codewars #46] Mixbonacci (5kyu) 문제 풀이

Instructions 링크 This is the first of my “-nacci” series. If you like this kata, check out the zozonacci sequence too. Task Mix -nacci sequences using a given pattern p. Return the first n e...

[Codewars #45] Loading Kata: Rot13 (5kyu)

[Codewars #45] Loading Kata: Rot13 (5kyu) 문제 풀이

Instructions 링크 ROT13 is a simple letter substitution cipher that replaces a letter with the letter 13 letters after it in the alphabet. ROT13 is an example of the Caesar cipher. Create a functi...

[Codewars #44] Domain name validator (5kyu)

[Codewars #44] Domain name validator (5kyu) 문제 풀이

Instructions 링크 In this kata you have to create a domain name validator mostly compliant with RFC 1035, RFC 1123, and RFC 2181 For purposes of this kata, following rules apply: Domain name m...

[Codewars #43] Integer triangles (5kyu)

[Codewars #43] Integer triangles (5kyu) 문제 풀이

Instructions 링크 You have to give the number of different integer triangles with one angle of 120 degrees which perimeters are under or equal a certain value. Each side of an integer triangle is a...