코드로 우주평화

Given a string made up of letters a, b, and/or c, switch the position of letters a and b (change a to b and vice versa). Leave any incidence of c untouched. Example: 'acb' --> 'bca' 'aabacbaa' --> 'bbabcabb' Solution: def switcheroo(s): return s.translate(str.maketrans("ab", "ba")) def switcheroo(s): return s.translate({ord('a'): 'b', ord('b'): 'a'})

When provided with a letter, return its position in the alphabet. Input :: "a" Ouput :: "Position of alphabet: 1" Solution: def position(alphabet): return f"Position of alphabet: {ord(alphabet)-96}"

If a = 1, b = 2, c = 3 ... z = 26 Then l + o + v + e = 54 and f + r + i + e + n + d + s + h + i + p = 108 So friendship is twice stronger than love :-) The input will always be in lowercase and never be empty. Solution: def words_to_marks(s: str, ord_num: int = 96): return sum(ord(i)-ord_num for i in s)

Write a function that always returns 5 Sounds easy right? Just bear in mind that you can't use any of the following characters: 0123456789*+-/ Good luck :) Solution: def unusual_five(): return int([i for i in str(ord("A"))].pop()) Other Solution: def unusual_five(): return len("five!") def unusual_five(): return ord("")

In a factory a printer prints labels for boxes. For one kind of boxes the printer has to use colors which, for the sake of simplicity, are named with letters from a to m. The colors used by the printer are recorded in a control string. For example a "good" control string would be aaabbbbhaijjjm meaning that the printer used three times color a, four times color b, one time color h then one time ..

Given a string of words, you need to find the highest scoring word. Each letter of a word scores points according to its position in the alphabet: a = 1, b = 2, c = 3 etc. You need to return the highest scoring word as a string. If two words score the same, return the word that appears earliest in the original string. All letters will be lowercase and all inputs will be valid. Solution: def high..

Welcome. In this kata you are required to, given a string, replace every letter with its position in the alphabet. If anything in the text isn't a letter, ignore it and don't return it. "a" = 1, "b" = 2, etc. Example alphabet_position("The sunset sets at twelve o' clock.") Should return "20 8 5 19 21 14 19 5 20 19 5 20 19 1 20 20 23 5 12 22 5 15 3 12 15 3 11" ( as a string ) Solution: from typin..

문제 설명 어떤 문장의 각 알파벳을 일정한 거리만큼 밀어서 다른 알파벳으로 바꾸는 암호화 방식을 시저 암호라고 합니다. 예를 들어 "AB"는 1만큼 밀면 "BC"가 되고, 3만큼 밀면 "DE"가 됩니다. "z"는 1만큼 밀면 "a"가 됩니다. 문자열 s와 거리 n을 입력받아 s를 n만큼 민 암호문을 만드는 함수, solution을 완성해 보세요. 제한 사항 공백은 아무리 밀어도 공백입니다. s는 알파벳 소문자, 대문자, 공백으로만 이루어져 있습니다. s의 길이는 8000이하입니다. n은 1 이상, 25이하인 자연수입니다. 해결 방법 1. s문자열을 반복하여 나눈다. 2. 문자중에 대문자와 소문자가 있는 확인 후 분기한다. 3. 알파벳 인덱스를 확인하고 거기에 n을 더하고 알파벨 전체 길이를 뺀다. 4. ..