human
Geek | Function to calculate the N - th Geek - onacci Number.
Stores the geekonacci series.
Store the first three terms of the series.
Iterate over the range [ 3 , N ].
Update the value of arr [ i ] as the sum of previous 3 terms in the series.
Return the last element of arr [ ] as the N - th term.
Driver Code"
Solution in Python:
 ... Can you provide a code to geek and the other steps required?
assistant
#Here is code to geek and the other steps required.
 def find ( A , B , C , N ) :
	arr = [ 0 ] * N
	arr [ 0 ] = A
	arr [ 1 ] = B
	arr [ 2 ] = C
	for i in range ( 3 , N ) :
		arr [ i ] = ( arr [ i - 1 ] + arr [ i - 2 ] + arr [ i - 3 ] )
	return arr [ N - 1 ]
A = 1
B = 3
C = 2
N = 4
print ( find ( A , B , C , N ) )