hash table with chaining within the table : <p>I have this assignment to complete. (I am new to java). I started to think about it and establish a plan. I am not looking for the answers just a feedback on my approach.  I am supposed to enter integers into a hash table using a chaining scheme within the hash table (different from the regular chaining scheme).  My idea is to use an arraylist so I can store data + pointer in each slot of the hash table. when a collision occurs, find an empty slot, insert the new integer and set the pointer from the original hashed slot to this new position in the arraylist.  This way I am building a sort of linked list within the array. does that make sense?  there is a hint about keeping track of the free space with a stack... here I have to say I am not sure how to use the stack in that instance</p>
