BEst

DESCRIPTION: Return the number (count) of vowels in the given string. We will consider a, e, i, o, u as vowels for this Kata (but not y). The input string will only consist of lower case letters and/or spaces. def get_count(sentence): print(sentence) return (sentence.count('a'))+(sentence.count('e'))+(sentence.count('i'))+(sentence.count('o'))+(sentence.count('u')) def getCount(s): return sum(c ..

DESCRIPTION: Given an array of integers, find the one that appears an odd number of times. There will always be only one integer that appears an odd number of times. Examples [7] should return 7, because it occurs 1 time (which is odd). [0] should return 0, because it occurs 1 time (which is odd). [1,1,2] should return 2, because it occurs 1 time (which is odd). [0,1,0,1,0] should return 0, beca..

DESCRIPTION: Write a function, persistence, that takes in a positive parameter num and returns its multiplicative persistence, which is the number of times you must multiply the digits in num until you reach a single digit. For example (Input --> Output): 39 --> 3 (because 3*9 = 27, 2*7 = 14, 1*4 = 4 and 4 has only one digit) 999 --> 4 (because 9*9*9 = 729, 7*2*9 = 126, 1*2*6 = 12, and finally 1..

패키지는 소문자로 시작(camelCase), 클래스는 대문자로 시작, 멤버 변수도 소문자로 시작(camelCase) 1. 반환값 O 매개변수 O 2. 반환값 X 매개변수 O 3. 반환값 O 매개변수 X 반환하는 값의 타입은 int. ※ Return 이 없으면 앞에 void 를 쓰면된다. - 함수는 단독 모듈로서 그냥 호출하면된다. - 메서드는 클라스안에 있는 모듈이고 그 클래스의 멤버변수를 이용해서 작동. To Be Cont

로컬 저장소에 있는 프로젝트를 깃허브 사이트를 통해 만든 저장소로 push 하는 경우에 이런 메세지가 뜨는 경우가 있다. 1 2 3 4 5 6 7 8 C:\Users\gitProject>git push origin master To https://github.com/userId/userProject.git ! [rejected] master -> master (non-fast-forward) error: failed to push some refs to 'https://github.com/userId/userProject.git' hint: Updates were rejected because the tip of your current branch is behind hint: its remote coun..

DESCRIPTION: Complete the solution so that it returns true if the first argument(string) passed in ends with the 2nd argument (also a string). Examples: solution('abc', 'bc') # returns true solution('abc', 'd') # returns false def solution(string, ending): print(string) print(ending) if ending=="": return True leng=len(ending) print(string[-leng:]) return string[-leng:]==ending

DESCRIPTION: Given the triangle of consecutive odd numbers: 1 3 5 7 9 11 13 15 17 19 21 23 25 27 29 ... Calculate the sum of the numbers in the nth row of this triangle (starting at index 1) e.g.: (Input --> Output) 1 --> 1 2 --> 3 + 5 = 8 def row_sum_odd_numbers(n): print("num:" ,n) row_start=1-n+n**2 print(row_start) ans=0 for i in range(n): ans+=row_start+2*i print(ans) return ans

The goal of this exercise is to convert a string to a new string where each character in the new string is "(" if that character appears only once in the original string, or ")" if that character appears more than once in the original string. Ignore capitalization when determining if a character is a duplicate. Examples "din" => "(((" "recede" => "()()()" "Success" => ")())())" "(( @" => "))((" ..

DESCRIPTION: Given two arrays a and b write a function comp(a, b) (orcompSame(a, b)) that checks whether the two arrays have the "same" elements, with the same multiplicities (the multiplicity of a member is the number of times it appears). "Same" means, here, that the elements in b are the elements in a squared, regardless of the order. Examples Valid arrays a = [121, 144, 19, 161, 19, 144, 19,..