How to implement the desired persistent data structure?

Question

Algorithms

I need to create an array, any element of which can be changed, thus obtaining a new (next) version of the array with the ability to access the first one. I got acquainted with the known persistent data structures, and from the height of my flight it seems to me that none of the main ones (persistent stack, queue and deque) is suitable. I write in Java.
Please tell me how this can be done

Answer 1

ImmutableList