We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Python
  3. Python Functionals
  4. Map and Lambda Function
  5. Discussions

Map and Lambda Function

Sort by

recency

|

501 Discussions

|

  • chan10495
     + 0 comments

    def fibonacci(n): l = [] [l.append(l[i - 1] + l[i - 2]) if i >= 2 else l.append(i) for i in range(0, n)] return l

  • molo7
     + 0 comments
        fibo_sequence = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377]

    for small range 0<=n<=15 it's easier to just hardcode them lol

  • dilajevolves
     + 0 comments
    cube = lambda x : x ** 3

def fibonacci(n : int):
    # return a list of fibonacci numbers
    if n == 0:
        return []
    elif n == 1:
        return [0]
    else:
        series = [0,1]
        for num in range(2,n):
            series.append(series[-1] + series[-2])
        return series

if __name__ == '__main__':
    n = int(input())
    print(list(map(cube, fibonacci(n))))

  • sukeshnaram2002
     + 0 comments
    cube = lambda x:x3
def fibonacci(n):
    # return a list of fibonacci numbers
    fib_list=[]
    a,b =0,1
    for _ in range(n):
        fib_list.append(a)
        a,b=b,a+b        
    return fib_list

if name == 'main':

    n = int(input())
print(list(map(cu**be, fibonacci(n))))

  • shruti_kapse06
     + 2 comments
    cube = lambda x:x**3# complete the lambda function 

def fibonacci(n):
    # return a list of fibonacci numbers
    if n == 0:
        return []
        
    elif n == 1:
        return [0]
        
    else:
        a = 0
        b = 1
        list1 = [a, b]
        for i in range(2,n):
            c = a+b
            a = b
            b = c
            list1.append(c)
            
        return list1