question: @ Override public int insert ( String elem ) { int firstIndex = ( int ) ( elem . charAt ( 0 ) - 'a' ) ; int middleIndex = ( int ) ( elem . charAt ( - 1 + elem . length ( ) / 2 ) - 'a' ) ; int lastIndex = ( int ) ( elem . charAt ( elem . length ( ) - 2 ) - 'a' ) ; storage [ firstIndex * 400 + middleIndex * 20 + lastIndex ] = elem ; return 1 ; }
target:  Insert element into collection. <p> Should the count of attempted slots reach the array size, declare that the  element cannot be added (either because of a poor hash function or because the array is full). <p> If element already exists within collection, return its position. That is, no duplicates are allowed, yet we silently ignore requests to repeatedly add the same element into the collection.