Question

Python Please..  Write the function kthDigit(n, k) that takes a possibly-negative int n and a non-negative int k, and returns the kth digit of n, starting from 0, counting from the right. So kthDigit(789, 0) returns 9, kthDigit(789, 2) returns 7, kthDigit(789, 3) returns 0, and kthDigit(-789, 0) returns 9.

Answer 1

def kthDigit(n, k):
    if n < 0:
        n = -1 * n
    count = 0
    while count < k:
        n //= 10
        count += 1
    return n % 10


print(kthDigit(789, 0))
print(kthDigit(789, 2))
print(kthDigit(789, 3))
print(kthDigit(-789, 0))