Creating a hash containing all the Fibonacci numbers upto the maximum data value in the circular linked list
HashSet < int > hash = new HashSet < int > ( ) ; createHash ( hash , maxEle ) ; Node ptr = head ; Node next ;