Code Playground

< h1 > Code Playground </ h1 >

-해당 문제는 codewars사이트의 level5 문제입니다. (1~8단계 중 8단계가 가장 쉬운 레벨)- [문제] Pete likes to bake some cakes. He has some recipes and ingredients. Unfortunately he is not good in maths. Can you help him to find out, how many cakes he could bake considering his recipes? Write a function cakes(), which takes the recipe (object) and the available ingredients (also an object) and returns the maximum number of cak..

-해당 문제는 codewars사이트의 level5 문제입니다. (1~8단계 중 8단계가 가장 쉬운 레벨)- [문제] Write an algorithm that takes an array and moves all of the zeros to the end, preserving the order of the other elements.moveZeros([false,1,0,1,2,0,1,3,"a"]) // returns[false,1,1,2,1,3,"a",0,0] [해석] 배열에 있는 모든 0을 맨 뒤로 옮기되, 다른 요소들의 위치는 변경시키면 안된다. 레벨5 라고는 하지만 내 생각엔 레벨6~7 정도 되는 쉬운 문제인 것 같다.배열에서 0만 맨 뒤로 옮겨서 출력하는 문제! var moveZeros = func..

-해당 문제는 codewars사이트의 level6 문제입니다. (1~8단계 중 8단계가 가장 쉬운 레벨)- [문제] Given an array, find the int that appears an odd number of times.There will always be only one integer that appears an odd number of times. findOdd([20,1,-1,2,-2,3,3,5,5,1,2,4,20,4,-1,-2,5]) ==> 5 출력findOdd([1,1,2,-2,5,2,4,4,-1,-2,5]) ==> -1 출력 [해석] 어떤 배열이 주어졌을 때 홀수번 등장하는 숫자를 구하여라. 홀수번 등장하는 숫자는 딱 하나만 있을것이다.예를 들어서 [20,1,-1,2,-2,3,3,..

-해당 문제는 codewars사이트의 level6 문제입니다. (1~8단계 중 8단계가 가장 쉬운 레벨)- [문제] Well met with Fibonacci bigger brother, AKA Tribonacci. As the name may already reveal, it works basically like a Fibonacci, but summing the last 3 (instead of 2) numbers of the sequence to generate the next. And, worse part of it, regrettably I won't get to hear non-native Italian speakers trying to pronounce it :( So, if we are t..

-해당 문제는 codewars사이트의 level6 문제입니다. (1~8단계 중 8단계가 가장 쉬운 레벨)- [문제] Write a function toWeirdCase (weirdcase in Ruby) that accepts a string, and returns the same string with all even indexed characters in each word upper cased, and all odd indexed characters in each word lower cased. The indexing just explained is zero based, so the zero-ith index is even, therefore that character should be upper ca..

-해당 문제는 codewars사이트의 level7 문제입니다. (1~8단계 중 8단계가 가장 쉬운 레벨)- [문제] 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 this case, all triangles must have surface greater than 0 to be accepted). Test.describe("PublicTest", function() { Test.assertEquals(isTriangle(1,2,2), t..

-해당 문제는 codewars사이트의 level7 문제입니다. (1~8단계 중 8단계가 가장 쉬운 레벨)- [문제] You might know some pretty large perfect squares. But what about the NEXT one? Complete the findNextSquare method that finds the next integral perfect square after the one passed as a parameter. Recall that an integral perfect square is an integer n such that sqrt(n) is also an integer. If the parameter is itself not a perfect squa..

-해당 문제는 codewars사이트의 level7 문제입니다. (1~8단계 중 8단계가 가장 쉬운 레벨)- [문제] Usually when you buy something, you're asked whether your credit card number, phone number or answer to your most secret question is still correct. However, since someone could look over your shoulder, you don't want that shown on your screen. Instead, we mask it. Your task is to write a function maskify, which changes all but the ..

-해당 문제는 codewars사이트의 level6 문제입니다.(1~8단계 중 8단계가 가장 쉬운 레벨)- [문제] Polycarpus works as a DJ in the best Berland nightclub, and he often uses dubstep music in his performance. Recently, he has decided to take a couple of old songs and make dubstep remixes from them. Let's assume that a song consists of some number of words (that don't contain WUB). To make the dubstep remix of this song, Polycarpus ..

-해당 문제는 codewars사이트의 level7 문제입니다.(1~8단계 중 8단계가 가장 쉬운 레벨)- [문제] Simple, given a string of words, return the length of the shortest word(s).String will never be empty and you do not need to account for different data types. Test.describe("Example tests",_=>{Test.assertEquals(findShort("bitcoin take over the world maybe who knows perhaps"), 3);Test.assertEquals(findShort("turns out random test cas..