In this **Map and Lambda Function** problem, You have to generate a list of the first N Fibonacci numbers, 0 being the first number. Then, apply the map function and a lambda expression to cube each Fibonacci number and print the list.

## Problem solution in Python 2 programming.

# Enter your code here. Read input from STDIN. Print output to STDOUT def fib(n): if n == 0: return 0 if n == 1: return 1 return fib(n-2) + fib(n-1) n = int(raw_input()) cube = lambda x: x*x*x print list(map(cube,[fib(a) for a in xrange(n)]))

## Problem solution in Python 3 programming.

cube = lambda x: pow(x,3)# complete the lambda function def fibonacci(n): # return a list of fibonacci numbers lis = [0,1] for i in range(2,n): lis.append(lis[i-2] + lis[i-1]) return(lis[0:n])

### Problem solution in pypy programming.

cube = lambda x: x**3 def fibonacci(n): # return a list of fibonacci numbers result = [0,1] for i in range(2,n): result.append(result[i-1]+result[i-2]) return result[:n]

### Problem solution in pypy3 programming.

cube = lambda x: pow(x,3)# complete the lambda function def fibonacci(n): # return a list of fibonacci numbers lis = [0,1] for i in range(2,n): lis.append(lis[i-2] + lis[i-1]) return(lis[0:n])

## 0 Comments