human
Find length of longest Fibonacci like subsequence | Function to return the max Length of Fibonacci subsequence.
Store all array elements in a hash table.
check until next fib element is found.
next element of fib subseq.
Driver Code"
Solution in Python:

=====
What is a code to find length of longest Fibonacci like subsequence and the other steps required?
assistant
#Here is code to find length of longest Fibonacci like subsequence and the other steps required.
 def LongestFibSubseq ( A , n ) :
	S = set ( A )
	maxLen = 0
	for i in range ( 0 , n ) :
		for j in range ( i + 1 , n ) :
			x = A [ j ]
			y = A [ i ] + A [ j ]
			length = 2
			while y in S :
				z = x + y
				x = y
				y = z
				length += 1
				maxLen = max ( maxLen , length )
	return maxLen if maxLen >= 3 else 0
if __name__ == " _ _ main _ _ " :
	A = [ 1 , 2 , 3 , 4 , 5 , 6 , 7 , 8 ]
	n = len ( A )
	print ( LongestFibSubseq ( A , n ) )