# function which return reverse of a string
def isPalindrome(s):
    return s == s[::-1]
 
# Driver code
s = "malayalam"
ans = isPalindrome(s)
 
if ans:
    print("Yes")
else:
    print("No")

""" Currency Converter
----------------------------------------
"""
import urllib.request
import json
def currency_converter(currency_from, currency_to, currency_input):
    yql_base_url = "https://query.yahooapis.com/v1/public/yql"
    yql_query = 'select%20*%20from%20yahoo.finance.xchange%20where%20pair' \
                '%20in%20("'+currency_from+currency_to+'")'
    yql_query_url = yql_base_url + "?q=" + yql_query + "&format=json&env=store%3A%2F%2Fdatatables.org%2Falltableswithkeys"
    try:
        yql_response = urllib.request.urlopen(yql_query_url)
        try:
            json_string = str(yql_response.read())
            json_string = json_string[2:
            json_string = json_string[:-1]
            print(json_string)
            yql_json = json.loads(json_string)
            last_rate = yql_json['query']['results']['rate']['Rate']
            currency_output = currency_input * float(last_rate)
            return currency_output
        except (ValueError, KeyError, TypeError):
            print(yql_query_url)
            return "JSON format error"
    except IOError as e:
        print(str(e))
currency_input = 1
#currency codes : http://en.wikipedia.org/wiki/ISO_4217
currency_from = "USD"
currency_to = "TRY"
rate = currency_converter(currency_from, currency_to, currency_input)
print(rate)

# Given a number n, print all primes smaller than or equal to n. It is also given that n is a small number.
# For example, if n is 10, the output should be “2, 3, 5, 7”. If n is 20, the output should be “2, 3, 5, 7, 11, 13, 17, 19”.


# Python program to print all primes smaller than or equal to
# n using Sieve of Eratosthenes

def SieveOfEratosthenes(n):
	
	# Create a boolean array "prime[0..n]" and initialize
	# all entries it as true. A value in prime[i] will
	# finally be false if i is Not a prime, else true.
	prime = [True for i in range(n + 1)]
	p = 2
	while (p * p <= n):
		
		# If prime[p] is not changed, then it is a prime
		if (prime[p] == True):
			
			# Update all multiples of p
			for i in range(p * 2, n + 1, p):
				prime[i] = False
		p += 1
	prime[0]= False
	prime[1]= False
	# Print all prime numbers
	for p in range(n + 1):
		if prime[p]:
			print (p)

# driver program
if __name__=='__main__':
    n = 30
    print("Following are the prime numbers smaller")
    print("than or equal to ", n)
    print("than or equal to ", n)
    SieveOfEratosthenes(n)

{"output":{"name":"format_final_json_response","arguments":{"output":{}}}}

import anytree as at
import random as rm

# Generate a tree with node_count many nodes. Each has a number key that shows when it was made and a randomly selected color, red or white.
def random_tree(node_count):
    
    # Generates the list of nodes
    nodes = []
    for i in range(node_count):
        test = rm.randint(1,2)
        if test == 1:
            nodes.append(at.Node(str(i),color="white"))
        else:
            nodes.append(at.Node(str(i),color="red"))
    
    #Creates the various main branches
    for i in range(node_count):
        for j in range(i, len(nodes)):
            test = rm.randint(1,len(nodes))
            if test == 1 and nodes[j].parent == None and (not nodes[i] == nodes[j]):
                nodes[j].parent = nodes[i]
    
    #Collects all the main branches into a single tree with the first node being the root
    for i in range(1, node_count):
        if nodes[i].parent == None and (not nodes[i] == nodes[0]):
            nodes[i].parent = nodes[0]

    return nodes[0]

def check_prop(fn, prop):
  return lambda obj: fn(obj[prop])
  
check_age = check_prop(lambda x: x >= 18, 'age')
user = {'name': 'Mark', 'age': 18}
check_age(user) # True