코드로 우주평화

Description: Born a misinterpretation of this kata, your task here is pretty simple: given an array of values and an amount of beggars, you are supposed to return an array with the sum of what each beggar brings home, assuming they all take regular turns, from the first to the last. For example: [1,2,3,4,5] for 2 beggars will return a result of [9,6], as the first one takes [1,3,5], the second c..

Description: Modify the kebabize function so that it converts a camel case string into a kebab case. kebabize('camelsHaveThreeHumps') // camels-have-three-humps kebabize('camelsHave3Humps') // camels-have-humps Notes: the returned string should only contain lowercase letters Solution: 1. Repeat the string with a for statement. 2. If there is a number, pass. 3. If there is a capital letter, add '..

Description: Given an array of integers of any length, return an array that has 1 added to the value represented by the array. the array can't be empty only non-negative, single digit integers are allowed Return nil (or your language's equivalent) for invalid inputs. Examples For example the array [2, 3, 9] equals 239, adding one would return the array [2, 4, 0]. [4, 3, 2, 5] would return [4, 3,..

Description: A square of squares You like building blocks. You especially like building blocks that are squares. And what you even like more, is to arrange them into a square of square building blocks! However, sometimes, you can't arrange them into a square. Instead, you end up with an ordinary rectangle! Those blasted things! If you just had a way to know, whether you're currently working in v..

Description: Count the number of divisors of a positive integer n. Random tests go up to n = 500000. Examples (input --> output) 4 --> 3 (1, 2, 4) 5 --> 2 (1, 5) 12 --> 6 (1, 2, 3, 4, 6, 12) 30 --> 8 (1, 2, 3, 5, 6, 10, 15, 30) Solution: 1. Repeat 'n' to generate numbers one after the other. 2. Check whether the generated numbers are divisible by 'n'. 3. Count the number of divisible numbers. fu..

오늘 한 것 JS + Node.js + Sequelize + MySQL을 사용하여 풀스택 웹 서비스 '핑퐁의 숲'을 만들었다. 깃헙링크 시연영상 성장한 점 Node.js로 서버를 열어보고 Sequelize로 MySQL과 연동해 볼 수 있었다. 버튼 이벤트를 활용해 서버에게 패치를 보내고 데이터베이스를 수정할 수 있었다. 처음으로 프론트부터 데이터베이스까지 풀스택 웹 서비스를 구현해 볼 수 있었다. 노력할 점 Node.js의 경우 책이나 다른 코드를 보고 참고를 한 것이기 때문에 다양한 기능들을 구현해보면서 숙달이 필요하다. 브라우저로부터 다양한 이벤트를 다룰 수 있도록 프론트단의 코드도 더 만져보고 싶다. 내일 하고 싶은 것 HTTP 강의 모두 듣고 정리해보고 싶다. TDD에 대해서 자세히 알아보고 실습..

Description: You are given two arrays a1 and a2 of strings. Each string is composed with letters from a to z. Let x be any string in the first array and y be any string in the second array. Find max(abs(length(x) − length(y))) If a1 and/or a2 are empty return -1 in each language except in Haskell (F#) where you will return Nothing (None). Example: a1 = ["hoqq", "bbllkw", "oox", "ejjuyyy", "plmii..

오늘 한 것 아침 10시부터 오후 6시까지 8시간 동안 기업과제를 수행하였다. (보안상 구체적인 내용은 적지 않겠습니다.) 성장한 점 8시간 동안 집중하여 코딩을 할 수 있었다. 평소 부족하다고 생각했던 부분을 이번에 해볼 수 있어서 좋았다. 노력할 점 부족하다고 느낀 부분들을 목록화하고 하나씩 집중해서 학습해보자. 내일 하고 싶은 것 컴퓨터 사이언스 개념 하나 이상을 요약정리하여 포스팅해보자.

Description: Your team is writing a fancy new text editor and you've been tasked with implementing the line numbering. Write a function which takes a list of strings and returns each line prepended by the correct number. The numbering starts at 1. The format is n: string. Notice the colon and space in between. Examples: number([]) // => [] number(["a", "b", "c"]) // => ["1: a", "2: b", "3: c"] S..

Description: As a part of this Kata, you need to create a function that when provided with a triplet, returns the index of the numerical element that lies between the other two elements. The input to the function will be an array of three distinct numbers (Haskell: a tuple). For example: gimme([2, 3, 1]) => 0 2 is the number that fits between 1 and 3 and the index of 2 in the input array is 0. A..