Check if in given list of numbers, are any two numbers closer to each other than given threshold.


Input to this function is a string containing multiple groups of nested parentheses. Your goal is to separate those group into separate strings and return the list of those. Separate groups are balanced (each open brace is properly closed) and not nested within each other Ignore any spaces in the input string.


Given a positive floating point number, it can be decomposed into and integer part (largest integer smaller than given number) and decimals (leftover part always smaller than 1).  Return the decimal part of the number.


You're given a list of deposit and withdrawal operations on a bank account that starts with zero balance. Your task is to detect if at any point the balance of account fallls below zero, and at that point function should return True. Otherwise it should return False.


For a given list of input numbers, calculate Mean Absolute Deviation around the mean of this dataset. Mean Absolute Deviation is the average absolute difference between each element and a centerpoint (mean in this case): MAD = average | x - x_mean |


Insert a number 'delimeter' between every two consecutive elements of input list `numbers'


Input to this function is a string represented multiple groups for nested parentheses separated by spaces. For each of the group, output the deepest level of nesting of parentheses. E.g. (()()) has maximum two levels of nesting while ((())) has three.


Filter an input list of strings only for ones that contain given substring


For a given list of integers, return a tuple consisting of a sum and a product of all the integers in a list. Empty sum should be equal to 0 and empty product should be equal to 1.


From a given list of integers, generate a list of rolling maximum element found until given moment in the sequence.


Input are two strings a and b consisting only of 1s and 0s. Perform binary XOR on these inputs and return result also as a string.


Out of list of strings, return the longest one. Return the first one in case of multiple strings of the same length. Return None in case the input list is empty.


Return a greatest common divisor of two integers a and b


Return list of all prefixes from shortest to longest of the input string


Return a string containing space-delimited numbers starting from 0 upto n inclusive.


Given a string, find out how many distinct characters (regardless of case) does it consist of


Input to this function is a string representing musical notes in a special ASCII format. Your task is to parse this string and return list of integers corresponding to how many beats does each not last.  Here is a legend: 'o' - whole note, lasts four beats 'o|' - half note, lasts two beats '.|' - quater note, lasts one beat


Find how many times a given substring can be found in the original string. Count overlaping cases.


Input is a space-delimited string of numberals from 'zero' to 'nine'. Valid choices are 'zero', 'one', 'two', 'three', 'four', 'five', 'six', 'seven', 'eight' and 'nine'. Return the string with numbers sorted from smallest to largest


From a supplied list of numbers (of length at least two) select and return two that are the closest to each other and return them in order (smaller number, larger number).


Given list of numbers (of at least two elements), apply a linear transform to that list, such that the smallest number will become 0 and the largest will become 1


Filter given list of any python values only for integers


Return length of given string


For a given number n, find the largest number that divides n evenly, smaller than n


Return list of prime factors of given integer in the order from smallest to largest. Each of the factors should be listed number of times corresponding to how many times it appeares in factorization. Input number should be equal to the product of all factors


From a list of integers, remove all elements that occur more than once. Keep order of elements left the same as in the input.


For a given string, flip lowercase characters to uppercase and uppercase to lowercase.


Concatenate list of strings into a single string


Filter an input list of strings only for ones that start with a given prefix.


Return only positive numbers in the list.


Return true if a given number is prime, and false otherwise.


This function takes a list l and returns a list l' such that l' is identical to l in the indicies that are not divisible by three, while its values at the indicies that are divisible by three are equal to the values of the corresponding indicies of l, but sorted.


Return sorted unique elements in a list


Return maximum element in the list.


Return the number of times the digit 7 appears in integers less than n which are divisible by 11 or 13.


This function takes a list l and returns a list l' such that l' is identical to l in the odd indicies, while its values at the even indicies are equal to the values of the even indicies of l, but sorted.


prime_fib returns n-th number that is a Fibonacci number and it's also prime.


triples_sum_to_zero takes a list of integers as an input. it returns True if there are three distinct elements in the list that sum to zero, and False otherwise.


Imagine a road that's a perfectly straight infinitely long line. n cars are driving left to right;  simultaneously, a different set of n cars are driving right to left.   The two sets of cars start out being very far from each other.  All cars move in the same speed.  Two cars are said to collide when a car that's moving left to right hits a car that's moving right to left. However, the cars are infinitely sturdy and strong; as a result, they continue moving in their trajectory as if they did not collide.


Return list with elements incremented by 1.


pairs_sum_to_zero takes a list of integers as an input. it returns True if there are two distinct elements in the list that sum to zero, and False otherwise.


Change numerical base of input number x to base. return string representation after the conversion. base numbers are less than 10.


Given length of a side and high return area for a triangle.


The Fib4 number sequence is a sequence similar to the Fibbonacci sequnece that's defined as follows: fib4(0) -> 0 fib4(1) -> 0 fib4(2) -> 2 fib4(3) -> 0 fib4(n) -> fib4(n-1) + fib4(n-2) + fib4(n-3) + fib4(n-4). Please write a function to efficiently compute the n-th element of the fib4 number sequence.  Do not use recursion.


Return median of elements in the list l.


Checks if given string is a palindrome


Return 2^n modulo p (be aware of numerics).


remove_vowels is a function that takes string and returns string without vowels.


Return True if all numbers in the list l are below threshold t.


Add two numbers x and y


Check if two words have the same characters.


Return n-th Fibonacci number.


brackets is a string of "<" and ">". return True if every opening bracket has a corresponding closing bracket.


Return True is list elements are monotonically increasing or decreasing.


Return sorted unique common elements for two lists.


Return the largest prime factor of n. Assume n > 1 and is not a prime.


sum_to_n is a function that sums numbers from 1 to n.


brackets is a string of "(" and ")". return True if every opening bracket has a corresponding closing bracket.


xs represent coefficients of a polynomial. xs[0] + xs[1] * x + xs[2] * x^2 + .... Return derivative of this polynomial in the same form.


The FibFib number sequence is a sequence similar to the Fibbonacci sequnece that's defined as follows: fibfib(0) == 0 fibfib(1) == 0 fibfib(2) == 1 fibfib(n) == fibfib(n-1) + fibfib(n-2) + fibfib(n-3). Please write a function to efficiently compute the n-th element of the fibfib number sequence.


Circular shift the digits of the integer x, shift the digits right by shift and return the result as a string. If shift > number of digits, return digits reversed.


Task Write a function that takes a string as input and returns the sum of the upper characters only' ASCII codes.  Examples: digitSum("") => 0 digitSum("abAB") => 131 digitSum("abcCd") => 67 digitSum("helloE") => 69 digitSum("woArBld") => 131


In this task, you will be given a string that represents a number of apples and oranges  that are distributed in a basket of fruit this basket contains  apples, oranges, and mango fruits. Given the string that represents the total number of  the oranges and apples and an integer that represent the total number of the fruits  in the basket return the number of the mango fruits in the basket. for examble: fruit_distribution("5 apples and 6 oranges", 19) ->19 - 5 - 6 = 8 fruit_distribution("0 apples and 1 oranges",3) -> 3 - 0 - 1 = 2 fruit_distribution("2 apples and 3 oranges", 100) -> 100 - 2 - 3 = 95


"Given an array representing a branch of a tree that has non-negative integer nodes your task is to pluck one of the nodes and return it. The plucked node should be the node with the smallest even value. If multiple nodes with the same smallest even value are found return the node that has smallest index.  The plucked node should be returned in a list, [ smalest_value, its index ], If there are no even values or the given array is empty, return [].  Example 1: Input: [4,2,3] Output: [2, 1] Explanation: 2 has the smallest even value, and 2 has the smallest index.  Example 2: Input: [1,2,3] Output: [2, 1] Explanation: 2 has the smallest even value, and 2 has the smallest index.   Example 3: Input: [] Output: []  Example 4: Input: [5, 0, 3, 0, 4, 2] Output: [0, 1] Explanation: 0 is the smallest value, but  there are two zeros, so we will choose the first zero, which has the smallest index.  Constraints: * 1 <= nodes.length <= 10000


You are given a non-empty list of positive integers. Return the greatest integer that is greater than  zero, and has a frequency greater than or equal to the value of the integer itself.  The frequency of an integer is the number of times it appears in the list. If no such a value exist, return -1. Examples: search([4, 1, 2, 2, 3, 1]) == 2 search([1, 2, 2, 3, 3, 3, 4, 4, 4]) == 3


Given list of integers, return list in strange order. Strange sorting, is when you start with the minimum value, then maximum of the remaining integers, then minimum and so on.  Examples: strange_sort_list([1, 2, 3, 4]) == [1, 4, 2, 3] strange_sort_list([5, 5, 5, 5]) == [5, 5, 5, 5]


Given the lengths of the three sides of a triangle. Return the area of the triangle rounded to 2 decimal points if the three sides form a valid triangle.  Otherwise return -1 Three sides make a valid triangle when the sum of any two sides is greater  than the third side. Example: triangle_area(3, 4, 5) == 6.00


Write a function that returns True if the object q will fly, and False otherwise. The object q will fly if it's balanced (it is a palindromic list) and the sum of its elements is less than or equal the maximum possible weight w.  Example: will_it_fly([1, 2], 5) ➞ False  # 1+2 is less than the maximum possible weight, but it's unbalanced.  will_it_fly([3, 2, 3], 1) ➞ False # it's balanced, but 3+2+3 is more than the maximum possible weight.  will_it_fly([3, 2, 3], 9) ➞ True # 3+2+3 is less than the maximum possible weight, and it's balanced.  will_it_fly([3], 5) ➞ True


Given an array arr of integers, find the minimum number of elements that need to be changed to make the array palindromic. A palindromic array is an array that is read the same backwards and forwards. In one change, you can change one element to any other element.  For example: smallest_change([1,2,3,5,4,7,9,6]) == 4 smallest_change([1, 2, 3, 4, 3, 2, 2]) == 1


Write a function that accepts two lists of strings and returns the list that has  total number of chars in the all strings of the list less than the other list.  if the two lists have the same number of chars, return the first list.  Examples total_match([], []) ➞ [] total_match(['hi', 'admin'], ['hI', 'Hi']) ➞ ['hI', 'Hi'] total_match(['hi', 'admin'], ['hi', 'hi', 'admin', 'project']) ➞ ['hi', 'admin'] total_match(['hi', 'admin'], ['hI', 'hi', 'hi']) ➞ ['hI', 'hi', 'hi']


Write a function that returns true if the given number is the multiplication of 3 prime numbers and false otherwise. Knowing that (a) is less then 100.  Example: is_multiply_prime(30) == True


Your task is to write a function that returns true if a number x is a simple power of n and false in other cases. x is a simple power of n if n**int=x For example: is_simple_power(1, 4) => true is_simple_power(2, 2) => true is_simple_power(8, 2) => true is_simple_power(3, 2) => false is_simple_power(3, 1) => false


Write a function that takes an integer a and returns True  if this ingeger is a cube of some integer number. Note: you may assume the input is always valid. Examples: iscube(1) ==> True iscube(2) ==> False iscube(-1) ==> True iscube(64) ==> True iscube(0) ==> True


You have been tasked to write a function that receives  a hexadecimal number as a string and counts the number of hexadecimal  digits that are primes (prime number, or a prime, is a natural number  greater than 1 that is not a product of two smaller natural numbers). Hexadecimal digits are 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, A, B, C, D, E, F. Prime numbers are 2, 3, 5, 7, 11, 13, 17,... So you have to determine a number of the following digits: 2, 3, 5, 7,  B (=decimal 11), D (=decimal 13). Note: you may assume the input is always correct or empty string,  and symbols A,B,C,D,E,F are always uppercase. Examples: For num = "AB" the output should be 1. For num = "1077E" the output should be 2. For num = "ABED1A33" the output should be 4. For num = "123456789ABCDEF0" the output should be 6.


You will be given a number in decimal form and your task is to convert it to binary format. The function should return a string, with each character representing a binary number. Each character in the string will be '0' or '1'.  There will be an extra couple of characters 'db' at the beginning and at the end of the string. The extra characters are there to help with the format.  Examples: decimal_to_binary(15)   # returns "db1111db"


You are given a string s. Your task is to check if the string is happy or not. A string is happy if its length is at least 3 and every 3 consecutive letters are distinct For example: is_happy(a) => False is_happy(aa) => False is_happy(abcd) => True is_happy(aabb) => False is_happy(adb) => True


It is the last week of the semester and the teacher has to give the grades to students. The teacher has been making her own algorithm for grading. The only problem is, she has lost the code she used for grading. She has given you a list of GPAs for some students and you have to write  a function that can output a list of letter grades using the following table: GPA       |    Letter grade 4.0                A+ > 3.7                A  > 3.3                A-  > 3.0                B+ > 2.7                B  > 2.3                B- > 2.0                C+ > 1.7                C > 1.3                C- > 1.0                D+  > 0.7                D  > 0.0                D- 0.0                E   Example:


Write a function that takes a string and returns True if the string length is a prime number or False otherwise Examples prime_length('Hello') == True prime_length('abcdcba') == True prime_length('kittens') == True


Given a positive integer n, return the count of the numbers of n-digit positive integers that start or end with 1


Given a positive integer N, return the total sum of its digits in binary.  Example For N = 1000, the sum of digits will be 1 the output should be "1". For N = 150, the sum of digits will be 6 the output should be "110". For N = 147, the sum of digits will be 12 the output should be "1100".  Variables: @N integer Constraints: 0 ≤ N ≤ 10000. Output:


Given a non-empty list of integers lst. add the even elements that are at odd indices..   Examples:


Write a function that takes a string and returns an ordered version of it. Ordered version of string, is a string where all words (separated by space) are replaced by a new word where all the characters arranged in ascending order based on ascii value. Note: You should keep the order of words and blank spaces in the sentence.  For example: anti_shuffle('Hi') returns 'Hi' anti_shuffle('hello') returns 'ehllo'


You are given a 2 dimensional data, as a nested lists, which is similar to matrix, however, unlike matrices, each row may contain a different number of columns. Given lst, and integer x, find integers x in the list, and return list of tuples, [(x1, y1), (x2, y2) ...] such that each tuple is a coordinate - (row, columns), starting with 0. Sort coordinates initially by rows in ascending order. Also, sort coordinates of the row by columns in descending order.  Examples: get_row([ [1,2,3,4,5,6], [1,2,3,4,1,6], [1,2,3,4,5,1] ], 1) == [(0, 0), (1, 4), (1, 0), (2, 5), (2, 0)] get_row([], 1) == []


Given an array of non-negative integers, return a copy of the given array after sorting, you will sort the given array in ascending order if the sum( first index value, last index value) is odd, or sort it in descending order if the sum( first index value, last index value) is even.  Note: * don't change the given array.  Examples: * sort_array([]) => [] * sort_array([5]) => [5] * sort_array([2, 4, 3, 0, 1, 5]) => [0, 1, 2, 3, 4, 5]


Create a function encrypt that takes a string as an argument and returns a string encrypted with the alphabet being rotated.  The alphabet should be rotated in a manner such that the letters  shift down by two multiplied to two places. For example: encrypt('hi') returns 'lm' encrypt('asdfghjkl') returns 'ewhjklnop' encrypt('gf') returns 'kj'


You are given a list of integers. Write a function next_smallest() that returns the 2nd smallest element of the list. Return None if there is no such element.  next_smallest([1, 2, 3, 4, 5]) == 2 next_smallest([5, 1, 4, 3, 2]) == 2 next_smallest([]) == None


You'll be given a string of words, and your task is to count the number of boredoms. A boredom is a sentence that starts with the word "I". Sentences are delimited by '.', '?' or '!'.  For example:


Create a function that takes 3 numbers. Returns true if one of the numbers is equal to the sum of the other two, and all numbers are integers. Returns false in any other cases.  Examples any_int(5, 2, 7) ➞ True  any_int(3, 2, 2) ➞ False  any_int(3, -2, 1) ➞ True


Write a function that takes a message, and encodes in such a  way that it swaps case of all letters, replaces all vowels in  the message with the letter that appears 2 places ahead of that  vowel in the english alphabet.  Assume only letters.   Examples:


You are given a list of integers. You need to find the largest prime value and return the sum of its digits.  Examples: For lst = [0,3,2,1,3,5,7,4,5,5,5,2,181,32,4,32,3,2,32,324,4,3] the output should be 10 For lst = [1,0,1,8,2,4597,2,1,3,40,1,2,1,2,4,2,5,1] the output should be 25 For lst = [1,3,1,32,5107,34,83278,109,163,23,2323,32,30,1,9,3] the output should be 13 For lst = [0,724,32,71,99,32,6,0,5,91,83,0,5,6] the output should be 11 For lst = [0,81,12,3,1,21] the output should be 3


Given a dictionary, return True if all keys are strings in lower  case or all keys are strings in upper case, else return False. The function should return False is the given dictionary is empty. Examples: check_dict_case({"a":"apple", "b":"banana"}) should return True. check_dict_case({"a":"apple", "A":"banana", "B":"banana"}) should return False. check_dict_case({"a":"apple", 8:"banana", "a":"apple"}) should return False. check_dict_case({"Name":"John", "Age":"36", "City":"Houston"}) should return False.


Implement a function that takes an non-negative integer and returns an array of the first n integers that are prime numbers and less than n. for example: count_up_to(5) => [2,3] count_up_to(11) => [2,3,5,7] count_up_to(0) => [] count_up_to(20) => [2,3,5,7,11,13,17,19] count_up_to(1) => []


Complete the function that takes two integers and returns  the product of their unit digits. Assume the input is always valid. Examples: multiply(148, 412) should return 16. multiply(19, 28) should return 72. multiply(2020, 1851) should return 0.


Given a string s, count the number of uppercase vowels in even indices.  For example: count_upper('aBCdEf') returns 1 count_upper('abcdefg') returns 0


Create a function that takes a value (string) representing a number and returns the closest integer to it. If the number is equidistant from two integers, round it away from zero.  Examples


Given a positive integer n, you have to make a pile of n levels of stones. The first level has n stones. The number of stones in the next level is: - the next odd number if n is odd. - the next even number if n is even. Return the number of stones in each level in a list, where element at index i represents the number of stones in the level (i+1).  Examples:


You will be given a string of words separated by commas or spaces. Your task is to split the string into words and return an array of the words.  For example: words_string("Hi, my name is John") == ["Hi", "my", "name", "is", "John"]


This function takes two positive numbers x and y and returns the biggest even integer number that is in the range [x, y] inclusive. If  there's no such number, then the function should return -1.  For example: choose_num(12, 15) = 14


You are given two positive integers n and m, and your task is to compute the average of the integers from n through m (including n and m).  Round the answer to the nearest integer and convert that to binary. If n is greater than m, return -1. Example: rounded_avg(1, 5) => "0b11" rounded_avg(7, 5) => -1 rounded_avg(10, 20) => "0b1111"


Given a list of positive integers x. return a sorted list of all  elements that hasn't any even digit.  Note: Returned list should be sorted in increasing order.  For example:


Given an array of integers, sort the integers that are between 1 and 9 inclusive, reverse the resulting array, and then replace each digit by its corresponding name from "One", "Two", "Three", "Four", "Five", "Six", "Seven", "Eight", "Nine".  For example: arr = [2, 1, 1, 4, 5, 8, 2, 3]    -> sort arr -> [1, 1, 2, 2, 3, 4, 5, 8]  -> reverse arr -> [8, 5, 4, 3, 2, 2, 1, 1] return ["Eight", "Five", "Four", "Three", "Two", "Two", "One", "One"]  If the array is empty, return an empty array: arr = [] return []  If the array has any strange number ignore it: arr = [1, -1 , 55]  -> sort arr -> [-1, 1, 55] -> reverse arr -> [55, 1, -1]


Implement the function f that takes n as a parameter, and returns a list of size n, such that the value of the element at index i is the factorial of i if i is even or the sum of numbers from 1 to i otherwise. i starts from 1. the factorial of i is the multiplication of the numbers from 1 to i (1 * 2 * ... * i). Example:


Given a positive integer n, return a tuple that has the number of even and odd integer palindromes that fall within the range(1, n), inclusive.  Example 1:  Input: 3 Output: (1, 2) Explanation: Integer palindrome are 1, 2, 3. one of them is even, and two of them are odd.  Example 2:  Input: 12 Output: (4, 6) Explanation: Integer palindrome are 1, 2, 3, 4, 5, 6, 7, 8, 9, 11. four of them are even, and 6 of them are odd.  Note: 1. 1 <= n <= 10^3


Write a function count_nums which takes an array of integers and returns the number of elements which has a sum of digits > 0. If a number is negative, then its first signed digit will be negative: e.g. -123 has signed digits -1, 2, and 3.


We have an array 'arr' of N integers arr[1], arr[2], ..., arr[N].The numbers in the array will be randomly ordered. Your task is to determine if it is possible to get an array sorted in non-decreasing order by performing  the following operation on the given array: You are allowed to perform right shift operation any number of times.  One right shift operation means shifting all elements of the array by one position in the right direction. The last element of the array will be moved to the starting position in the array i.e. 0th index.   If it is possible to obtain the sorted array by performing the above operation then return True else return False. If the given array is empty then return True.  Note: The given list is guaranteed to have unique elements.  For Example:  move_one_ball([3, 4, 5, 1, 2])==>True Explanation: By performin 2 right shift operations, non-decreasing order can be achieved for the given array. move_one_ball([3, 5, 4, 1, 2])==>False Explanation:It is not possible to get non-decreasing order for the given


In this problem, you will implement a function that takes two lists of numbers, and determines whether it is possible to perform an exchange of elements between them to make lst1 a list of only even numbers. There is no limit on the number of exchanged elements between lst1 and lst2. If it is possible to exchange elements between the lst1 and lst2 to make all the elements of lst1 to be even, return "YES". Otherwise, return "NO". For example: exchange([1, 2, 3, 4], [1, 2, 3, 4]) => "YES" exchange([1, 2, 3, 4], [1, 5, 3, 4]) => "NO"


Given a string representing a space separated lowercase letters, return a dictionary of the letter with the most repetition and containing the corresponding count. If several letters have the same occurrence, return all of them.  Example: histogram('a b c') == {'a': 1, 'b': 1, 'c': 1} histogram('a b b a') == {'a': 2, 'b': 2} histogram('a b c a b') == {'a': 2, 'b': 2} histogram('b b b b a') == {'b': 4}


Task We are given two strings s and c, you have to deleted all the characters in s that are equal to any character in c then check if the result string is palindrome. A string is called palindrome if it reads the same backward as forward. You should return a tuple containing the result string and True/False for the check. Example For s = "abcde", c = "ae", the result should be ('bcd',False) For s = "abcdef", c = "b"  the result should be ('acdef',False)


Given a list of strings, where each string consists of only digits, return a list. Each element i of the output should be "the number of odd elements in the string i of the input." where all the i's should be replaced by the number of odd digits in the i'th string of the input.


Given an array of integers nums, find the minimum sum of any non-empty sub-array of nums. Example minSubArraySum([2, 3, 4, 1, 2, 4]) == 1


You are given a rectangular grid of wells. Each row represents a single well, and each 1 in a row represents a single unit of water. Each well has a corresponding bucket that can be used to extract water from it,  and all buckets have the same capacity. Your task is to use the buckets to empty the wells. Output the number of times you need to lower the buckets.  Example 1: Input:  grid : [[0,0,1,0], [0,1,0,0], [1,1,1,1]] bucket_capacity : 1 Output: 6  Example 2: Input:  grid : [[0,0,1,1], [0,0,0,0], [1,1,1,1], [0,1,1,1]] bucket_capacity : 2 Output: 5  Example 3: Input:  grid : [[0,0,0], [0,0,0]] bucket_capacity : 5 Output: 0  Constraints: * all wells have the same length * 1 <= grid.length <= 10^2 * 1 <= grid[:,1].length <= 10^2 * grid[i][j] -> 0 | 1


In this Kata, you have to sort an array of non-negative integers according to number of ones in their binary representation in ascending order. For similar number of ones, sort based on decimal value.  It must be implemented like this:


Given a string s and a natural number n, you have been tasked to implement  a function that returns a list of all words from string s that contain exactly  n consonants, in order these words appear in the string s. If the string s is empty then the function should return an empty list. Note: you may assume the input string contains only letters and spaces. Examples: select_words("Mary had a little lamb", 4) ==> ["little"] select_words("Mary had a little lamb", 3) ==> ["Mary", "lamb"] select_words("simple white space", 2) ==> [] select_words("Hello world", 4) ==> ["world"]


You are given a word. Your task is to find the closest vowel that stands between  two consonants from the right side of the word (case sensitive).  Vowels in the beginning and ending doesn't count. Return empty string if you didn't find any vowel met the above condition.   You may assume that the given string contains English letter only.  Example: get_closest_vowel("yogurt") ==> "u" get_closest_vowel("FULL") ==> "U" get_closest_vowel("quick") ==> ""


You are given a list of two strings, both strings consist of open parentheses '(' or close parentheses ')' only. Your job is to check if it is possible to concatenate the two strings in some order, that the resulting string will be good. A string S is considered to be good if and only if all parentheses in S are balanced. For example: the string '(())()' is good, while the string '())' is not. Return 'Yes' if there's a way to make a good string, and return 'No' otherwise.  Examples: match_parens(['()(', ')']) == 'Yes'


Given an array arr of integers and a positive integer k, return a sorted list  of length k with the maximum k numbers in arr.  Example 1:  Input: arr = [-3, -4, 5], k = 3 Output: [-4, -3, 5]  Example 2:  Input: arr = [4, -4, 4], k = 2 Output: [4, 4]  Example 3:  Input: arr = [-3, 2, 1, 2, -1, -2, 1], k = 1 Output: [2]  Note: 1. The length of the array will be in the range of [1, 1000]. 2. The elements in the array will be in the range of [-1000, 1000].


Given a non-empty list of integers, return the sum of all of the odd elements that are in even positions.   Examples solution([5, 8, 7, 1]) ==> 12 solution([3, 3, 3, 3, 3]) ==> 9


Given a non-empty array of integers arr and an integer k, return the sum of the elements with at most two digits from the first k elements of arr.  Example:  Input: arr = [111,21,3,4000,5,6,7,8,9], k = 4 Output: 24 # sum of 21 + 3  Constraints: 1. 1 <= len(arr) <= 100


Given a positive integer n, return a sorted list that has the odd numbers in collatz sequence.  The Collatz conjecture is a conjecture in mathematics that concerns a sequence defined as follows: start with any positive integer n. Then each term is obtained from the  previous term as follows: if the previous term is even, the next term is one half of  the previous term. If the previous term is odd, the next term is 3 times the previous term plus 1. The conjecture is that no matter what value of n, the sequence will always reach 1.  Note:  1. Collatz(1) is [1]. 2. returned list sorted in increasing order.  For example:


You have to write a function which validates a given date string and returns True if the date is valid otherwise False. The date is valid if all of the following rules are satisfied: 1. The date string is not empty. 2. The number of days is not less than 1 or higher than 31 days for months 1,3,5,7,8,10,12. And the number of days is not less than 1 or higher than 30 days for months 4,6,9,11. And, the number of days is not less than 1 or higher than 29 for the month 2. 3. The months should not be less than 1 or higher than 12. 4. The date should be in the format: mm-dd-yyyy  for example:  valid_date('03-11-2000') => True  valid_date('15-01-2012') => False  valid_date('04-0-2040') => False  valid_date('06-04-2020') => True


Given a string of words, return a list of words split on whitespace, if no whitespaces exists in the text you should split on commas ',' if no commas exists you should return the number of lower-case letters with odd order in the alphabet, ord('a') = 0, ord('b') = 1, ... ord('z') = 25 Examples split_words("Hello world!") ➞ ["Hello", "world!"] split_words("Hello,world!") ➞ ["Hello", "world!"]


Given a list of numbers, return whether or not they are sorted in ascending order. If list has more than 1 duplicate of the same number, return False. Assume no negative numbers and only integers.  Examples is_sorted([5]) ➞ True is_sorted([1, 2, 3, 4, 5]) ➞ True is_sorted([1, 3, 2, 4, 5]) ➞ False is_sorted([1, 2, 3, 4, 5, 6]) ➞ True is_sorted([1, 2, 3, 4, 5, 6, 7]) ➞ True is_sorted([1, 3, 2, 4, 5, 6, 7]) ➞ False is_sorted([1, 2, 2, 3, 3, 4]) ➞ True


You are given two intervals, where each interval is a pair of integers. For example, interval = (start, end) = (1, 2). The given intervals are closed which means that the interval (start, end) includes both start and end. For each given interval, it is assumed that its start is less or equal its end. Your task is to determine whether the length of intersection of these two  intervals is a prime number. Example, the intersection of the intervals (1, 3), (2, 4) is (2, 3) which its length is 1, which not a prime number. If the length of the intersection is a prime number, return "YES", otherwise, return "NO". If the two intervals don't intersect, return "NO".   [input/output] samples: intersection((1, 2), (2, 3)) ==> "NO" intersection((-1, 1), (0, 4)) ==> "NO"


You are given an array arr of integers and you need to return sum of magnitudes of integers multiplied by product of all signs of each number in the array, represented by 1, -1 or 0. Note: return None for empty arr.  Example:


Given a grid with N rows and N columns (N >= 2) and a positive integer k,  each cell of the grid contains a value. Every integer in the range [1, N * N] inclusive appears exactly once on the cells of the grid.  You have to find the minimum path of length k in the grid. You can start from any cell, and in each step you can move to any of the neighbor cells, in other words, you can go to cells which share an edge with you current cell. Please note that a path of length k means visiting exactly k cells (not necessarily distinct). You CANNOT go off the grid. A path A (of length k) is considered less than a path B (of length k) if after making the ordered lists of the values on the cells that A and B go through (let's call them lst_A and lst_B), lst_A is lexicographically less than lst_B, in other words, there exist an integer index i (1 <= i <= k) such that lst_A[i] < lst_B[i] and for any j (1 <= j < i) we have lst_A[j] = lst_B[j]. It is guaranteed that the answer is unique. Return an ordered list of the values on the cells that the minimum path go through.  Examples:  Input: grid = [ [1,2,3], [4,5,6], [7,8,9]], k = 3 Output: [1, 2, 1]  Input: grid = [ [5,9,3], [4,1,6], [7,8,2]], k = 1


Everyone knows Fibonacci sequence, it was studied deeply by mathematicians in  the last couple centuries. However, what people don't know is Tribonacci sequence. Tribonacci sequence is defined by the recurrence: tri(1) = 3 tri(n) = 1 + n / 2, if n is even. tri(n) =  tri(n - 1) + tri(n - 2) + tri(n + 1), if n is odd. For example: tri(2) = 1 + (2 / 2) = 2 tri(4) = 3 tri(3) = tri(2) + tri(1) + tri(4) = 2 + 3 + 3 = 8  You are given a non-negative integer number n, you have to a return a list of the  first n + 1 numbers of the Tribonacci sequence. Examples:


Given a positive integer n, return the product of the odd digits. Return 0 if all digits are even. For example: digits(1)  == 1 digits(4)  == 0


Create a function that takes a string as input which contains only square brackets. The function should return True if and only if there is a valid subsequence of brackets  where at least one bracket in the subsequence is nested.  is_nested('[[]]') ➞ True is_nested('[]]]]]]][[[[[]') ➞ False is_nested('[][]') ➞ False is_nested('[]') ➞ False is_nested('[[][]]') ➞ True


You are given a list of numbers. You need to return the sum of squared numbers in the given list, round each element in the list to the upper int(Ceiling) first. Examples: For lst = [1,2,3] the output should be 14 For lst = [1,4,9] the output should be 98 For lst = [1,3,5,7] the output should be 84 For lst = [1.4,4.2,0] the output should be 29


Create a function that returns True if the last character of a given string is an alphabetical character and is not a part of a word, and False otherwise. Note: "word" is a group of characters separated by space.  Examples: check_if_last_char_is_a_letter("apple pie") ➞ False check_if_last_char_is_a_letter("apple pi e") ➞ True check_if_last_char_is_a_letter("apple pi e ") ➞ False


Create a function which returns the largest index of an element which is not greater than or equal to the element immediately preceding it. If no such element exists then return -1. The given array will not contain duplicate values.  Examples: can_arrange([1,2,4,3,5]) = 3


Create a function that returns a tuple (a, b), where 'a' is the largest of negative integers, and 'b' is the smallest of positive integers in a list. If there is no negative or positive integers, return them as None.  Examples: largest_smallest_integers([2, 4, 1, 3, 5, 7]) == (None, 1) largest_smallest_integers([]) == (None, None)


Create a function that takes integers, floats, or strings representing real numbers, and returns the larger variable in its given variable type. Return None if the values are equal. Note: If a real number is represented as a string, the floating point might be . or ,  compare_one(1, 2.5) ➞ 2.5 compare_one(1, "2,3") ➞ "2,3" compare_one("5,1", "6") ➞ "6"


Evaluate whether the given number n can be written as the sum of exactly 4 positive even numbers Example is_equal_to_sum_even(4) == False is_equal_to_sum_even(6) == False


The Brazilian factorial is defined as: brazilian_factorial(n) = n! * (n-1)! * (n-2)! * ... * 1! where n > 0  For example:


Given a string text, replace all spaces in it with underscores,  and if a string has more than 2 consecutive spaces,  then replace all consecutive spaces with -   fix_spaces("Example") == "Example" fix_spaces("Example 1") == "Example_1" fix_spaces(" Example 2") == "_Example_2"


Create a function which takes a string representing a file's name, and returns 'Yes' if the the file's name is valid, and returns 'No' otherwise. A file's name is considered to be valid if and only if all the following conditions  are met: - There should not be more than three digits ('0'-'9') in the file's name. - The file's name contains exactly one dot '.' - The substring before the dot should not be empty, and it starts with a letter from  the latin alphapet ('a'-'z' and 'A'-'Z'). - The substring after the dot should be one of these: ['txt', 'exe', 'dll'] Examples: file_name_check("example.txt") # => 'Yes'


" This function will take a list of integers. For all entries in the list, the function shall square the integer entry if its index is a  multiple of 3 and will cube the integer entry if its index is a multiple of 4 and not a multiple of 3. The function will not  change the entries in the list whose indexes are not a multiple of 3 or 4. The function shall then return the sum of all entries.   Examples: For lst = [1,2,3] the output should be 6 For lst = []  the output should be 0


You are given a string representing a sentence, the sentence contains some words separated by a space, and you have to return a string that contains the words from the original sentence, whose lengths are prime numbers, the order of the words in the new string should be the same as the original one.  Example 1: Input: sentence = "This is a test" Output: "is"  Example 2: Input: sentence = "lets go for swimming" Output: "go for"  Constraints: * 1 <= len(sentence) <= 100


Your task is to implement a function that will simplify the expression x * n. The function returns True if x * n evaluates to a whole number and False otherwise. Both x and n, are string representation of a fraction, and have the following format, <numerator>/<denominator> where both numerator and denominator are positive whole numbers.  You can assume that x, and n are valid fractions, and do not have zero as denominator.  simplify("1/5", "5/1") = True simplify("1/6", "2/1") = False


Write a function which sorts the given list of integers in ascending order according to the sum of their digits. Note: if there are several items with similar sum of their digits, order them based on their index in original list.  For example:


Write a function that takes an array of numbers as input and returns  the number of elements in the array that are greater than 10 and both  first and last digits of a number are odd (1, 3, 5, 7, 9). For example: specialFilter([15, -73, 14, -15]) => 1


You are given a positive integer n. You have to create an integer array a of length n. For each i (1 ≤ i ≤ n), the value of a[i] = i * i - i + 1. Return the number of triples (a[i], a[j], a[k]) of a where i < j < k,  and a[i] + a[j] + a[k] is a multiple of 3.  Example : Input: n = 5 Output: 1 Explanation:  a = [1, 3, 7, 13, 21]


There are eight planets in our solar system: the closerst to the Sun  is Mercury, the next one is Venus, then Earth, Mars, Jupiter, Saturn,  Uranus, Neptune. Write a function that takes two planet names as strings planet1 and planet2.  The function should return a tuple containing all planets whose orbits are  located between the orbit of planet1 and the orbit of planet2, sorted by  the proximity to the sun.  The function should return an empty tuple if planet1 or planet2 are not correct planet names.  Examples bf("Jupiter", "Neptune") ==> ("Saturn", "Uranus") bf("Earth", "Mercury") ==> ("Venus")


Write a function that accepts a list of strings as a parameter, deletes the strings that have odd lengths from it, and returns the resulted list with a sorted order, The list is always a list of strings and never an array of numbers, and it may contain duplicates. The order of the list should be ascending by length of each word, and you should return the list sorted by that rule. If two words have the same length, sort the list alphabetically. The function should return a list of strings in sorted order. You may assume that all words will have the same length. For example: assert list_sort(["aa", "a", "aaa"]) => ["aa"]


A simple program which should return the value of x if n is  a prime number and should return the value of y otherwise.  Examples: for x_or_y(7, 34, 12) == 34


Given a list of numbers, return the sum of squares of the numbers in the list that are odd. Ignore numbers that are negative or not integers.  double_the_difference([1, 3, 2, 0]) == 1 + 9 + 0 + 0 = 10 double_the_difference([-1, -2, 0]) == 0 double_the_difference([9, -2]) == 81 double_the_difference([0]) == 0


You will be given the name of a class (a string) and a list of extensions. The extensions are to be used to load additional classes to the class. The strength of the extension is as follows: Let CAP be the number of the uppercase letters in the extension's name, and let SM be the number of lowercase letters  in the extension's name, the strength is given by the fraction CAP - SM.  You should find the strongest extension and return a string in this  format: ClassName.StrongestExtensionName. If there are two or more extensions with the same strength, you should choose the one that comes first in the list. For example, if you are given "Slices" as the class and a list of the extensions: ['SErviNGSliCes', 'Cheese', 'StuFfed'] then you should return 'Slices.SErviNGSliCes' since 'SErviNGSliCes' is the strongest extension  (its strength is -1). Example:


You are given 2 words. You need to return True if the second word or any of its rotations is a substring in the first word cycpattern_check("abcd","abd") => False cycpattern_check("hello","ell") => True cycpattern_check("whassup","psus") => False cycpattern_check("abab","baa") => True cycpattern_check("efef","eeff") => False


Given an integer. return a tuple that has the number of even and odd digits respectively.  Example: even_odd_count(-12) ==> (1, 1)


Given a positive integer, obtain its roman numeral equivalent as a string, and return it in lowercase. Restrictions: 1 <= num <= 1000  Examples:


Given the lengths of the three sides of a triangle. Return True if the three sides form a right-angled triangle, False otherwise. A right-angled triangle is a triangle in which one angle is right angle or  90 degree. Example: right_angle_triangle(3, 4, 5) == True


Write a function that accepts a list of strings. The list contains different words. Return the word with maximum number of unique characters. If multiple strings have maximum number of unique characters, return the one which comes first in lexicographical order.  find_max(["name", "of", "string"]) == "string" find_max(["name", "enam", "game"]) == "enam"


You're a hungry rabbit, and you already have eaten a certain number of carrots, but now you need to eat more carrots to complete the day's meals. you should return an array of [ total number of eaten carrots after your meals, the number of carrots left after your meals ] if there are not enough remaining carrots, you will eat all remaining carrots, but will still be hungry.  Example: * eat(5, 6, 10) -> [11, 4] * eat(4, 8, 9) -> [12, 1] * eat(1, 10, 10) -> [11, 0] * eat(2, 11, 5) -> [7, 0]  Variables: @number : integer the number of carrots that you have eaten. @need : integer the number of carrots that you need to eat. @remaining : integer the number of remaining carrots thet exist in stock  Constrain: * 0 <= number <= 1000 * 0 <= need <= 1000 * 0 <= remaining <= 1000


Given two lists operator, and operand. The first list has basic algebra operations, and  the second list is a list of integers. Use the two given lists to build the algebric  expression and return the evaluation of this expression.  The basic algebra operations: Addition ( + )  Subtraction ( - )  Multiplication ( * )  Floor division ( // )  Exponentiation ( ** )   Example: operator['+', '*', '-'] array = [2, 3, 4, 5] result = 2 + 3 * 4 - 5 => result = 9  Note: The length of operator list is equal to the length of operand list minus one. Operand is a list of of non-negative integers.


You are given a string s. if s[i] is a letter, reverse its case from lower to upper or vise versa,  otherwise keep it as it is. If the string contains no letters, reverse the string. The function should return the resulted string. Examples solve("1234") = "4321" solve("ab") = "AB"


Given a string 'text', return its md5 hash equivalent string. If 'text' is an empty string, return None.


Given two positive integers a and b, return the even digits between a and b, in ascending order.  For example: generate_integers(2, 8) => [2, 4, 6, 8] generate_integers(8, 2) => [2, 4, 6, 8]