오늘의 CODE

Instructions. If we were to set up a Tic-Tac-Toe game, we would want to know whether the board's current state is solved, wouldn't we? Our goal is to create a function that will check that for us! 틱택토 게임을 만들었다면, 보드의 현재 상태가 해결됐는지 여부를 알고 싶지 않은가? 우리의 목표는 그것을 확인할 함수를 만들어내는 것이다. Assume that the board comes in the form of a 3x3 array, where the value is 0 if a spot is empty, 1 if it is an "X", or 2 if..

Instructions. Given a list of integers and a single sum value, return the first two values (parse from the left please) in order of appearance that add up to form the sum. sum_pairs([11, 3, 7, 5], 10) # ^--^ 3 + 7 = 10 == [3, 7] sum_pairs([4, 3, 2, 3, 4], 6) # ^-----^ 4 + 2 = 6, indices: 0, 2 * # ^-----^ 3 + 3 = 6, indices: 1, 3 # ^-----^ 2 + 4 = 6, indices: 2, 4 # * entire pair is earlier, and ..

Instruction. In this kata, you will write a function that returns the positions and the values of the "peaks" (or local maxima) of a numeric array. For example, the array arr = [0, 1, 2, 5, 1, 0] has a peak at position 3 with a value of 5 (since arr[3] equals 5). The output will be returned as an object with two properties: pos and peaks. Both of these properties should be arrays. If there is no..

Instruction. Move the first letter of each word to the end of it, then add 'ay' to the end of the word. Leave punctuation marks untouched. 각 단어의 첫번째 글자를 단어의 마지막으로 옮기고 그 뒤에 'ay'를 추가해라. 부호는 변경하지 마라. Example. pigIt('Pig latin is cool'); // igPay atinlay siay oolcay pigIt('Hello world !'); // elloHay orldway ! Solution. function pigIt(str){ let result = []; let arr = str.split(' '); for(let word of ..

Instruction. Write an algorithm that takes an array and moves all of the zeros to the end, preserving the order of the other elements. 배열 요소 중 0을 제외한 나머지 요소의 순서를 유지하면서, 배열에 포함된 0을 모두 마지막으로 이동 시키는 알고리즘을 완성하라. Example. moveZeros([false, 1, 0, 1, 2, 0, 1, 3, "a"]) // returns [false, 1, 1, 2, 1, 3, "a", 0, 0] Solution. function moveZeros(arr) { return arr.filter(function(x) {return x !== 0}) .concat..

Instructions. The main idea is to count all the occurring characters in a string. If you have a string like aba, then the result should be {'a': 2, 'b': 1}. What if the string is empty? Then the result should be empty object literal, {} 중요한 것은 모든 숫자열의 숫자를 세는 것이다. 예를들어 aba 라는 문자열이 있을 경우, {'a': 2, 'b':1} 이라는 산출물을 가지게 될 것이다. 빈 문자열의 경우 빈 객체 리터럴을 반환해야 한다. Solution. function count(string) { const arr ..

Instruction. 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 fixtures. 음이 아닌 정수(초)를 입력받아 사..

Description. Write a function named first_non_repeating_letter that takes a string input, and returns the first character that is not repeated anywhere in the string. For example, if given the input 'stress', the function should return 't', since the letter t only occurs once in the string, and occurs first in the string. As an added challenge, upper- and lowercase letters are considered the sam..

Descriptions. Write a function that takes a string of parentheses, and determines if the order of the parentheses is valid. The function should return true if the string is valid, and false if it's invalid. 문자열로 괄호를 받아 짝이 유효한지에 따라 반환값을 결정하는 함수를 만들어라. 함수는 문자열이 유효하다면 true를 반환하며 그렇지 않으면 false를 반환한다. Examples(with result). "()" => true ")(()))" => false "(" => false "(())((()())())" => true Constrai..

Description. Write a function that takes in a string of one or more words, and returns the same string, but with all five or more letter words reversed(Just like the name of this Kata). String passed in will consist of only letters and spaces. Spaces will be included only when more than one word is present. 하나 이상의 문자열을 받는 함수를 작성하고 받은 문자열을 반환해라. 단, 5자 이상의 문자열은 모두 반전하여 반환해라(제목처럼). 문자열은 문자와 공백으로만 구..