Question: 
Write a function to find if the given number is a keith number or not.


Model's Code:
def is_num_keith(n):
    digits = [int(x) for x in str(n)]
    k = len(digits)
    seq = sum(digits)
    
    while seq < n:
        seq = sum(digits)
        digits.append(seq)
        digits.pop(0)
    
    return seq == n



Sample Correct Code:
def is_num_keith(x): 
	terms = [] 
	temp = x 
	n = 0 
	while (temp > 0): 
		terms.append(temp % 10) 
		temp = int(temp / 10) 
		n+=1 
	terms.reverse() 
	next_term = 0 
	i = n 
	while (next_term < x): 
		next_term = 0 
		for j in range(1,n+1): 
			next_term += terms[i - j] 
		terms.append(next_term) 
		i+=1 
	return (next_term == x) 


Asserts:
assert is_num_keith(14) == True
assert is_num_keith(12) == False
assert is_num_keith(197) == True


Tests:
Test 1 of 3: PASS
Test 2 of 3: PASS
Test 3 of 3: PASS

Test 179 of 974: 133/179 (74.30167597765363%): success