티스토리

BEst
검색하기

블로그 홈

BEst

thomaschoi.tistory.com/m

Oppan BackEnd Style

구독자
0
방명록 방문하기

주요 글 목록

  • Reducing by steps DESCRIPTION: Data: an array of integers, a function f of two variables and an init value. Example: a = [2, 4, 6, 8, 10, 20], f(x, y) = x + y; init = 0 Output: an array of integers, say r, such that r = [r[0] = f(init, a[0]), r[1] = f(r[0], a[1]), r[2] = f(r[1], a[2]), ...] With our example: r = [2, 6, 12, 20, 30, 50] Task: Write the following functions of two variables som : (x, y) -> x + y mini.. 공감수 0 댓글수 0 2022. 11. 28.
  • Land perimeter DESCRIPTION: Task: Given an array arr of strings complete the function landPerimeter by calculating the total perimeter of all the islands. Each piece of land will be marked with 'X' while the water fields are represented as 'O'. Consider each tile being a perfect 1 x 1piece of land. Some examples for better visualization: ['XOOXO', 'XOOXO', 'OOOXO', 'XXOXO', 'OXOOO'] or should return: "Total la.. 공감수 0 댓글수 0 2022. 11. 27.
  • Christmas tree DESCRIPTION: Create a function that returns a christmas tree of the correct height. For example: height = 5 should return: * *** ***** ******* ********* Height passed is always an integer between 0 and 100. Use \n for newlines between each line. Pad with spaces so each line is the same length. The last line having only stars, no spaces. def christmas_tree(height): if height==0: return "" alist=[.. 공감수 0 댓글수 0 2022. 11. 27.
  • Lowest product of 4 consecutive numbers DESCRIPTION: Create a function that returns the lowest product of 4 consecutive digits in a number given as a string. This should only work if the number has 4 digits or more. If not, return "Number is too small". Example lowest_product("123456789") --> 24 (1x2x3x4) lowest_product("35") --> "Number is too small" def lowest_product(input): print(input) alist=[] if len(input) 공감수 0 댓글수 0 2022. 11. 27.
  • Most Frequent Weekdays DESCRIPTION: What is your favourite day of the week? Check if it's the most frequent day of the week in the year. You are given a year as integer (e. g. 2001). You should return the most frequent day(s) of the week in that year. The result has to be a list of days sorted by the order of days in week (e. g. ['Monday', 'Tuesday'], ['Saturday', 'Sunday'], ['Monday', 'Sunday']). Week starts with Mon.. 공감수 0 댓글수 0 2022. 11. 27.
  • Message Validator DESCRIPTION: In this kata, you have an input string and you should check whether it is a valid message. To decide that, you need to split the string by the numbers, and then compare the numbers with the number of characters in the following substring. For example "3hey5hello2hi" should be split into 3, hey, 5, hello, 2, hi and the function should return true, because "hey" is 3 characters, "hell.. 공감수 0 댓글수 0 2022. 11. 27.
  • Clocky Mc Clock-Face DESCRIPTION: Story Due to lack of maintenance the minute-hand has fallen off Town Hall clock face. And because the local council has lost most of our tax money to a Nigerian email scam there are no funds to fix the clock properly. Instead, they are asking for volunteer programmers to write some code that tell the time by only looking at the remaining hour-hand! What a bunch of cheapskates! Can y.. 공감수 0 댓글수 0 2022. 11. 24.
  • The Office V - Find a Chair DESCRIPTION: So you've found a meeting room - phew! You arrive there ready to present, and find that someone has taken one or more of the chairs!! You need to find some quick.... check all the other meeting rooms to see if all of the chairs are in use. Your meeting room can take up to 8 chairs. need will tell you how many have been taken. You need to find that many. Find the spare chairs from th.. 공감수 0 댓글수 0 2022. 11. 24.
  • Split and then add both sides of an array together. DESCRIPTION: Inspired by the Fold an Array kata. This one is sort of similar but a little different. Task You will receive an array as parameter that contains 1 or more integers and a number n. Here is a little visualization of the process: Step 1: Split the array in two: [1, 2, 5, 7, 2, 3, 5, 7, 8] / \ [1, 2, 5, 7] [2, 3, 5, 7, 8] Step 2: Put the arrays on top of each other: [1, 2, 5, 7] [2, 3,.. 공감수 0 댓글수 0 2022. 11. 23.
  • Who has the most money? DESCRIPTION: You're going on a trip with some students and it's up to you to keep track of how much money each Student has. A student is defined like this: class Student: def __init__(self, name, fives, tens, twenties): self.name = name self.fives = fives self.tens = tens self.twenties = twenties As you can tell, each Student has some fives, tens, and twenties. Your job is to return the name of .. 공감수 0 댓글수 0 2022. 11. 23.
  • Sorting on planet Twisted-3-7 DESCRIPTION: #Sorting on planet Twisted-3-7 There is a planet... in a galaxy far far away. It is exactly like our planet, but it has one difference: #The values of the digits 3 and 7 are twisted. Our 3 means 7 on the planet Twisted-3-7. And 7 means 3. Your task is to create a method, that can sort an array the way it would be sorted on Twisted-3-7. 7 Examples from a friend from Twisted-3-7: [1,2.. 공감수 0 댓글수 0 2022. 11. 22.
  • Financing Plan on Planet XY140Z-n DESCRIPTION: I need to save some money to buy a gift. I think I can do something like that: First week (W0) I save nothing on Sunday, 1 on Monday, 2 on Tuesday... 6 on Saturday, second week (W1) 2 on Monday... 7 on Saturday and so on according to the table below where the days are numbered from 0 to 6. Can you tell me how much I will have for my gift on Saturday evening after I have saved 12? (Y.. 공감수 0 댓글수 0 2022. 11. 22.
  • Irreducible Sum of Rationals DESCRIPTION: You will have a list of rationals in the form lst = [ [numer_1, denom_1] , ... , [numer_n, denom_n] ] or lst = [ (numer_1, denom_1) , ... , (numer_n, denom_n) ] where all numbers are positive integers. You have to produce their sum N / D in an irreducible form: this means that N and D have only 1 as a common divisor. Return the result in the form: [N, D] in Ruby, Crystal, Python, Cl.. 공감수 0 댓글수 0 2022. 11. 22.
  • Integer Depth DESCRIPTION: The depth of an integer n is defined to be how many multiples of n it is necessary to compute before all 10 digits have appeared at least once in some multiple. example: let see n=42 Multiple value digits comment 42*1 42 2,4 42*2 84 8 4 existed 42*3 126 1,6 2 existed 42*4 168 - all existed 42*5 210 0 2,1 existed 42*6 252 5 2 existed 42*7 294 9 2,4 existed 42*8 336 3 6 existed 42*9 3.. 공감수 0 댓글수 0 2022. 11. 22.
  • Sort array by string length DESCRIPTION: Write a function that takes an array of strings as an argument and returns a sorted array containing the same strings, ordered from shortest to longest. For example, if this array were passed as an argument: ["Telescopes", "Glasses", "Eyes", "Monocles"] Your function would return the following array: ["Eyes", "Glasses", "Monocles", "Telescopes"] All of the strings in the array passe.. 공감수 0 댓글수 0 2022. 11. 21.
  • Run-length encoding Run-length encoding (RLE) is a very simple form of data compression in which runs of data (that is, sequences in which the same data value occurs in many consecutive data elements) are stored as a single data value and count, rather than as the original run. Wikipedia Task Your task is to write such a run-length encoding. For a given string, return a list (or array) of pairs (or arrays) [ (i1, s.. 공감수 0 댓글수 1 2022. 11. 20.
  • Descending Order DESCRIPTION: Your task is to make a function that can take any non-negative integer as an argument and return it with its digits in descending order. Essentially, rearrange the digits to create the highest possible number. Examples: Input: 42145 Output: 54421 Input: 145263 Output: 654321 Input: 123456789 Output: 987654321 def descending_order(num): return int(''.join(sorted(str(num))[::-1])) 공감수 0 댓글수 0 2022. 11. 20.
  • Highest Rank Number in an Array DESCRIPTION: Complete the method which returns the number which is most frequent in the given input array. If there is a tie for most frequent number, return the largest number among them. Note: no empty arrays will be given. Examples [12, 10, 8, 12, 7, 6, 4, 10, 12] --> 12 [12, 10, 8, 12, 7, 6, 4, 10, 12, 10] --> 12 [12, 10, 8, 8, 3, 3, 3, 3, 2, 4, 10, 12, 10] --> 3 def highest_rank(arr): adict.. 공감수 0 댓글수 0 2022. 11. 19.
  • Range Extraction DESCRIPTION: A format for expressing an ordered list of integers is to use a comma separated list of either individual integers or a range of integers denoted by the starting integer separated from the end integer in the range by a dash, '-'. The range includes all integers in the interval including both endpoints. It is not considered a range unless it spans at least 3 numbers. For example "12,.. 공감수 0 댓글수 0 2022. 11. 18.
  • Sort Arrays(Ignoring case) DESCRIPTION: Sort the given array of strings in alphabetical order, case insensitive. For example: ["Hello", "there", "I'm", "fine"] --> ["fine", "Hello", "I'm", "there"] ["C", "d", "a", "B"]) --> ["a", "B", "C", "d"] def sortme(words): print(words) temp=[] for i in range(len(words)): temp.append(words[i].lower()) temp=sorted(temp) temp2=temp.copy() for i in range(len(words)): ind=temp.index(wor.. 공감수 0 댓글수 0 2022. 11. 18.
  • Sum two arrays DESCRIPTION: Your task is to create a function called sum_arrays(), which takes two arrays consisting of integers, and returns the sum of those two arrays. The twist is that (for example) [3,2,9] does not equal 3 + 2 + 9, it would equal '3' + '2' + '9' converted to an integer for this kata, meaning it would equal 329. The output should be an array of the sum in a similar fashion to the input (fo.. 공감수 0 댓글수 0 2022. 11. 18.
  • Triangle Number Check DESCRIPTION: Description: A triangle number is a number where n objects form an equilateral triangle (it's a bit hard to explain). For example, 6 is a triangle number because you can arrange 6 objects into an equilateral triangle: 1 2 3 4 5 6 8 is not a triangle number because 8 objects do not form an equilateral triangle: 1 2 3 4 5 6 7 8 In other words, the nth triangle number is equal to the s.. 공감수 0 댓글수 0 2022. 11. 18.
  • Pascal's Triangle #2 DESCRIPTION: Here you will create the classic Pascal's triangle. Your function will be passed the depth of the triangle and your code has to return the corresponding Pascal's triangle up to that depth. The triangle should be returned as a nested array. For example: pascal(5) -> [ [1], [1,1], [1,2,1], [1,3,3,1], [1,4,6,4,1] ] To build the triangle, start with a single 1 at the top, for each numbe.. 공감수 0 댓글수 0 2022. 11. 17.
  • Design a simple automation DESCRIPTION: Create a finite automaton that has three states. Finite automatons are the same as finite state machines for our purposes. Our simple automaton, accepts the language of A, defined as {0, 1} and should have three states: q1, q2, and q3. Here is the description of the states: q1 is our start state, we begin reading commands from here q2 is our accept state, we return true if this is o.. 공감수 0 댓글수 0 2022. 11. 17.
  • Is the meetup age-diverse? DESCRIPTION: You will be given an array of objects (associative arrays in PHP) representing data about developers who have signed up to attend the next coding meetup that you are organising. Your task is to return: true if developers from all of the following age groups have signed up: teens, twenties, thirties, forties, fifties, sixties, seventies, eighties, nineties, centenarian (at least 100 .. 공감수 0 댓글수 0 2022. 11. 17.
  • Permute a Palindrome DESCRIPTION: Write a function that will check whether ANY permutation of the characters of the input string is a palindrome. Bonus points for a solution that is efficient and/or that uses only built-in language functions. Deem yourself brilliant if you can come up with a version that does not use any function whatsoever. Example madam -> True adamm -> True junk -> False Hint The brute force appr.. 공감수 0 댓글수 0 2022. 11. 17.
  • Round by 0.5 steps DESCRIPTION: Round any given number to the closest 0.5 step I.E. solution(4.2) = 4 solution(4.3) = 4.5 solution(4.6) = 4.5 solution(4.8) = 5 Round up if number is as close to previous and next 0.5 steps. solution(4.75) == 5 def solution(n): rem=0 num=int(str(n).split(".")[0]) dec=n-num if dec=0.25 and dec 공감수 0 댓글수 0 2022. 11. 16.
  • Collatz DESCRIPTION: Preface A collatz sequence, starting with a positive integern, is found by repeatedly applying the following function to n until n == 1 : f(n)={n/2, if n is even3n+1, if n is oddf(n) = \begin{cases} n/2, \text{ if $n$ is even} \\ 3n+1, \text{ if $n$ is odd} \end{cases}f(n)={n/2, if n is even3n+1, if n is odd​ A more detailed description of the collatz conjecture may be found on Wiki.. 공감수 0 댓글수 0 2022. 11. 15.
  • Is Integer Array? DESCRIPTION: Write a function with the signature shown below: def is_int_array(arr): return True returns true / True if every element in an array is an integer or a float with no decimals. returns true / True if array is empty. returns false / False for every other input. def is_int_array(arr): print(arr) if arr=="": return False if arr==None: return False if len(arr)==0: return True if None in .. 공감수 0 댓글수 0 2022. 11. 15.
  • First Character that repeats DESCRIPTION: Find the first character that repeats in a String and return that character. first_dup('tweet') => 't' first_dup('like') => None This is not the same as finding the character that repeats first. In that case, an input of 'tweet' would yield 'e'. Another example: In 'translator' you should return 't', not 'a'. v v translator ^ ^ While second 'a' appears before second 't', the first '.. 공감수 0 댓글수 0 2022. 11. 15.
    문의안내
    • 티스토리
    • 로그인
    • 고객센터

    티스토리는 카카오에서 사랑을 담아 만듭니다.

    © Kakao Corp.