Your job is to write function last_digits(n,d) which return the last `d` digits of an integer `n` as a list.
`n` will be from 0 to 10^10

Examples:

`last_digits(1,1)     --> [1]`

`last_digits(1234,2)   --> [3,4]`

`last_digits(637547,6) --> [6,3,7,5,4,7]`

Special cases:

If `d` > the number of digits, just return the number's digits as a list.

If `d` <= 0, then return an empty list.

This is the first kata I have made, so please report any issues.

Difficulty: introductory

Starter code:

def solution(n,d):
	

Solutions:
def solution(n, d):
    return [int(c) for c in str(n)[-d:]] if d > 0 else []

def solution(n,d):
    s = str(n)
    return list(map(int,s))[-d if d>0 else len(s):]

def solution(n,d):
    if d <= 0:
        return []
    else:
        return ([int(i) for i in str(n)][-d:])

def solution(n,d):
    return list(map(int, list(str(n)[-d:]))) if d > 0 else []

def solution(n,d):
    return [int(s) for s in str(n)[-d:]] if d > 0 else []

def solution(n,l):
    return [] if l<=0 else [int(d) for d in str(n)][-l:]

def solution(n, d):
    if d >= len(str(n)):
        list_return = list(str(n))
        for i in range(len(list_return)):
            list_return[i] = int(list_return[i])
        return list_return
    if d <= 0:
        return []
    list_return = list((str(n)[-d:]))
    for i in range(len(list_return)):
        list_return[i] = int(list_return[i])
    return list_return



def solution(n, d):
    return [int(i) for i in str(n)[-d:]] if d > 0 else []

def solution(n,d):
    return [] if d<=0 else [int(c) for c in str(n)[-d:]]

def solution(n,d):
    return [int(i) for i in str(n)][::-1][:d][::-1] if d > 0 else []