Write a function that takes an array of integers and returns that array rotated by N positions.
For example, if N=2, given the input array [1, 2, 3, 4, 5, 6] the function should return [5, 6, 1, 2, 3, 4]
Write a function that takes as input a binary tree, and prints out each level of the tree on a newline. For example: a / b c / / d e f will output: a b c d e f
Write a program to reverse a number in python?
Write a python program to check if a number is an armstrong number?
Write a python program to print table of a given number?
Write a program to find sum of the digits of a number in python?
Write a function that takes an array of integers and efficiently calculates and returns the Least Common Multiply in python.
Write a function to efficiently convert a floating point number to a rational number. For example, given 0.125 return "1/8"
Write a python program to check if a number is a perfect number?
Write a function, tokenize_string(input_string, delimiter_list) that returns a list of strings that are separated by the delimiters. For example: tokenize_string("How now, Mrs. Brown Cow") returns ['How', 'now', 'Mrs', 'Brown', 'Cow']
Write a python program to find the second largest number in a list?
Write a function that takes an unsorted integer array, and returns a three element subset whose sum is zero.
Write a python program to check if a number is a prime number?